On the linear k-arboricity of cubic graphs

Discrete Mathematics

Volumn 162, Issue 1-3, 1996, Pages 293-297

  Jackson, Bill ^a   Wormald, Nicholas C ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037693108     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00293-6     Document Type: Article

References (9)

1. J. Akiyama, G. Exoo and F. Harary, Covering and packing in graphs II, cyclic and acyclic invariants, Math. Slovaca 30 (1980) 405-417.
2. J.C. Bermond, J.L. Fouquet, M. Habib and B. Péroche, On linear k-arboricity, Discrete Math. 52 (1984) 123-132.
3. D. Delamarre, J.L. Fouquet, H. Thuillier and B. Virot, Linear k-arboricity of cubic graphs, preprint.
4. J. Edmonds, Paths, trees, and flowers, Can. J. Math. 17 (1965) 449-467.
5. T. Gallai, Kritische Graphen II, Magyar Tud. Akad. Mat. Kutató Int. Közl. 8 (1963) 373-395.
6. T. Gallai, Maximale Systeme unabhängiger Kanten, Magyar Tud. Akad. Mat. Kutató Int. Közl. 9 (1964) 401-403.
7. M. Habib and B. Péroche, Some problems about linear arboricity, Discrete Math. 41 (1982) 219-220.
8. F. Harary, Covering and packing in graphs I, Ann. New York Acad. Sci. 175 (1970) 198-205.
9. J. Petersen, Die Theorie der regulären Graphen, Acta Math. 15 (1891) 193-220.