论文信息 - Decompositions of highly connected graphs into paths of length 3

Decompositions of highly connected graphs into paths of length 3

We prove that a 171-edge-connected graph has an edge-decomposition into paths of length 3 if and only its size is divisible by 3. It is a long-standing problem whether 2-edge-connectedness is sufficient for planar triangle-free graphs, and whether 3-edge-connectedness suffices for graphs in general. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 286–292, 2008

Carsten Thomassen

[1] Katherine Heinrich,et al. P 4 -decompositions of regular graphs , 1999 .

[2] John Adrian Bondy. Perfect path double covers of graphs , 1990, J. Graph Theory.

[3] Reinhard Diestel,et al. Graph Theory , 1997 .

[4] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .

[5] C. Thomassen,et al. Claw-decompositions and tutte-orientations , 2006 .

[6] Gerhard Reinelt,et al. On partitioning the edges of graphs into connected subgraphs , 1985, J. Graph Theory.

[7] W. Mader. A Reduction Method for Edge-Connectivity in Graphs , 1978 .

[8] Daniela Kühn,et al. Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree , 2004, Comb..

[9] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .

[10] Carsten Thomassen. Girth in graphs , 1983, J. Comb. Theory, Ser. B.

[11] D. A. Waller. Double covers of graphs , 1976, Bulletin of the Australian Mathematical Society.

[12] Michael Tarsi,et al. Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture , 1997, SIAM J. Comput..

[13] W. T. Tutte. On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[14] Carsten Thomassen,et al. Edge-decompositions of highly connected graphs into paths , 2008 .

[15] J. A. Bondy,et al. Graph Theory with Applications , 1978 .