On isomorphic linear partitions in cubic graphs
暂无分享,去创建一个
[1] Dingjun Lou,et al. Partitioning regular graphs into equicardinal linear forests , 1991, Discret. Math..
[2] Lars Døvling Anderson. The strong chromatic index of a cubic graph is at most 10 , 1992 .
[3] 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.
[4] Jean-Claude Bermond,et al. On linear k-arboricity , 1984, Discret. Math..
[5] William T. Trotter,et al. Induced matchings in cubic graphs , 1993, J. Graph Theory.
[6] V. Sós,et al. Irregularities of partitions , 1989 .
[7] F. Harary. COVERING AND PACKING IN GRAPHS, I. , 1970 .
[8] J. A. Bondy,et al. Progress in Graph Theory , 1984 .
[9] J. Bondy. Balanced colourings and the four colour conjecture , 1972 .
[10] F. Harary,et al. Covering and packing in graphs. III: Cyclic and acyclic invariants , 1980 .
[11] Henri Thuillier,et al. On linear arboricity of cubic graphs , 2007 .
[12] Nicholas C. Wormald,et al. More on the linear k-arboricity of regular graphs , 1998, Australas. J Comb..
[13] Angelika Steger,et al. On induced matchings , 1993, Discret. Math..
[14] R. Schelp,et al. THE STRONG CHROMATIC INDEX OF GRAPHS , 1990 .