More on the linear k-arboricity of regular graphs

Australasian Journal of Combinatorics

Volumn 18, Issue , 1998, Pages 97-104

  Aldred, R E L ^a   Wormald, Nicholas C ^b  

^a UNIVERSITY OF OTAGO   (New Zealand)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038707564     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. J. Akiyama, G. Exoo and F. Harary, Covering and packing ingraphs III, cyclic and acyclic invariants, Math. Slovaca 30 (1980), 405-417.
2. N. Alon and J.H. Spencer, The Probabilistic Method, Wiley, New York (1992).
3. N. Alon, The linear arboricity of graphs, Israel Journal of Mathematics 62 No. 3 (1988), 311-325.
4. N. Alon, Private communication.
5. J.E. Bermond, J.L. Fouquet, M. Habib and B. Peroche, On linear k-arboricity, Discrete Math. 52 (1984), 123-132.
6. D. Delamarre, J.L. Fouquet, H. Thuillier and B. Virot, Linear k-arboricity of cubic graphs, preprint.
7. F. Harary, Covering and packing in graphs I, Ann. New York Acad. Sci. 175 (1970), 198-205.
8. Bill Jackson and Nicholas C. Wormald, On the linear arboricity of cubic graphs, Discrete Math. 162 (1996), 293-297.
9. T. Lindquester and Nicholas C. Wormald, Linear arboricity of r-regular graphs, submitted.
10. J. Petersen, Die Theorie der regulären Graphen, Acta Math. 15 (1891), 193-220.