Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs

2017 ◽  
Vol 31 (2) ◽  
pp. 766-782 ◽  
Author(s):  
Naonori Kakimura ◽  
Ken-ichi Kawarabayashi ◽  
Yusuke Kobayashi
Keyword(s):  
Connected Graphs ◽  
Edge Disjoint ◽  
Eulerian Subgraphs

scholarly journals The edge geodetic self decomposition number of a graph

2020 ◽  
Author(s):  
John J ◽  
Stalin D
Keyword(s):  
Connected Graph ◽  
Maximum Cardinality ◽  
Connected Graphs ◽  
Edge Disjoint ◽  
General Properties ◽  
Geodetic Number ◽  
Simple Connected Graph ◽  
Decomposition Number

Let  G = (V, E)  be a simple connected  graph  of order  p and  size q.  A decomposition  of a graph  G is a collection  π  of edge-disjoint sub graphs  G1, G2, ..., Gn  of G such  that every  edge of G belongs to exactly  one Gi , (1 ≤ i ≤ n) . The decomposition  π = {G1, G2, ....Gn } of a connected  graph  G is said to be an edge geodetic self decomposi- tion  if ge (Gi ) = ge (G), (1 ≤ i ≤ n).The maximum  cardinality of π is called the edge geodetic self decomposition  number of G and is denoted by πsge (G), where ge (G) is the edge geodetic number  of G.  Some general properties   satisfied  by  this  concept  are  studied.    Connected  graphs which are edge geodetic self decomposable  are characterized.

scholarly journals Edge Disjoint Paths in Moderately Connected Graphs

2010 ◽  
Vol 39 (5) ◽  
pp. 1856-1887 ◽  
Author(s):  
Satish Rao ◽  
Shuheng Zhou
Keyword(s):  
Disjoint Paths ◽  
Connected Graphs ◽  
Edge Disjoint

scholarly journals Edge-disjoint odd cycles in 4-edge-connected graphs

2016 ◽  
Vol 119 ◽  
pp. 12-27 ◽  
Author(s):  
Ken-ichi Kawarabayashi ◽  
Yusuke Kobayashi
Keyword(s):  
Connected Graphs ◽  
Edge Disjoint ◽  
Odd Cycles

Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs

2003 ◽  
Vol 42 (4) ◽  
pp. 308-319 ◽  
Author(s):  
Zhi-Hong Chen ◽  
Hong-Jian Lai ◽  
Xiangwen Li ◽  
Deying Li ◽  
Jinzhong Mao
Keyword(s):  
Line Graphs ◽  
Connected Graphs ◽  
Hamiltonian Line Graphs ◽  
Eulerian Subgraphs

The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs

COMBINATORICA ◽  
2014 ◽  
Vol 35 (4) ◽  
pp. 477-495 ◽  
Author(s):  
Ken-ichi Kawarabayashi ◽  
Yusuke Kobayashi
Keyword(s):  
Disjoint Paths ◽  
Connected Graphs ◽  
Edge Disjoint ◽  
Eulerian Graphs

scholarly journals Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

2011 ◽  
Vol 101 (4) ◽  
pp. 214-236 ◽  
Author(s):  
Mark Bilinski ◽  
Bill Jackson ◽  
Jie Ma ◽  
Xingxing Yu
Keyword(s):  
Connected Graphs ◽  
Eulerian Subgraphs

Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs

2011 ◽  
Vol 29 (2) ◽  
pp. 275-280 ◽  
Author(s):  
Xiangwen Li ◽  
Chunxiang Wang ◽  
Qiong Fan ◽  
Zhaohong Niu ◽  
Liming Xiong
Keyword(s):  
Connected Graphs ◽  
Eulerian Subgraphs
Sign in / Sign up

Export Citation Format

Share Document