Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5

Journal of Combinatorial Theory. Series B

Volumn 75, Issue 1, 1999, Pages 100-109

  Thomassen, Carsten ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001925042     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1868     Document Type: Article

References (5)

1. Akiyama J., Exoo G., Harary F. Covering and packing in graphs. II. Cyclic and acyclic invariants. Math. Slovaca. 30:1980;405-417.
2. Akiyama J., Chvátal V. A short proof of the linear arboricity for cubic graphs. Bull. Liber. Arts Sci. NMS. 2:1981.
3. R. E. L. Aldred, N. C. Wormald.
4. Bermond J. C., Fouquet J. L., Habib M., Péroche B. On lineark. Discrete Math. 52:1984;123-132.
5. Jackson B., Wormald N. C. On the lineark. Discrete Math. 162:1996;293-297.