论文信息 - On isomorphic linear partitions in cubic graphs

On isomorphic linear partitions in cubic graphs

A linear forest is a graph whose connected components are chordless paths. A linear partition of a graph G is a partition of its edge set into linear forests and la(G) is the minimum number of linear forests in a linear partition. It is well known that la(G)=2 when G is a cubic graph and Wormald [N. Wormald, Problem 13, Ars Combinatoria 23(A) (1987) 332-334] conjectured that if |V(G)|=0 (mod 4), then it is always possible to find a linear partition in two isomorphic linear forests. Here, we give some new results concerning this conjecture.

[1] J. A. Bondy,et al. Progress in Graph Theory , 1984 .

[2] J. Bondy. Balanced colourings and the four colour conjecture , 1972 .

[3] F. Harary. COVERING AND PACKING IN GRAPHS, I. , 1970 .

[4] William T. Trotter,et al. Induced matchings in cubic graphs , 1993, J. Graph Theory.

[5] R. Schelp,et al. THE STRONG CHROMATIC INDEX OF GRAPHS , 1990 .

[6] F. Harary,et al. Covering and packing in graphs. III: Cyclic and acyclic invariants , 1980 .

[7] Henri Thuillier,et al. On linear arboricity of cubic graphs , 2007 .

[8] Nicholas C. Wormald,et al. More on the linear k-arboricity of regular graphs , 1998, Australas. J Comb..

[9] Dingjun Lou,et al. Partitioning regular graphs into equicardinal linear forests , 1991, Discret. Math..

[10] Lars Døvling Anderson. The strong chromatic index of a cubic graph is at most 10 , 1992 .

[11] Angelika Steger,et al. On induced matchings , 1993, Discret. Math..

[12] Carsten Thomassen. Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5 , 1999, J. Comb. Theory, Ser. B.

[13] Jean-Claude Bermond,et al. On linear k-arboricity , 1984, Discret. Math..