Star arboricity of graphs

Discrete Mathematics

Volumn 149, Issue 1-3, 1996, Pages 93-98

  Hakimi, S L ^a   Mitchem, J ^b   Schmeichel, E ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039948237     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00313-8     Document Type: Article

References (10)

1. J. Akiyama and M. Kano, Path factors of a graph, in: F. Harary and J. Maybee, eds., Graphs and Applications: Proc. First Colorado Sympos. on Graph Theory (Wiley, New York, 1985) 1-21.
2. I. Algor and N. Alon, The star arboricity of graphs, Discrete Math. 75 (1989) 11-22.
3. N. Alon, C. McDiarmid and B. Reed, Star arboricity, Combinatorica 12 (1992) 375-380.
4. Y. Aoki, The star-arboricity of the complete regular multipartite graphs, Discrete Math. 81 (1990) 115-122.
5. M. Behzad, G. Chartrand and L. Lesniak-Foster, Graphs and Digraphs (Wadsworth, Belmont, CA, 1979).
6. O. Borodin, On acyclic colorings of planar graphs, Discrete Math. 25 (1979) 211-236.
7. Y. Egawa, T. Fukada, S. Nagoya and M. Urabe, A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components, Discrete Math. 58 (1986) 93-95.
8. M. Garey and D. Johnson, Computers and Intractability, (Freeman, San Francisco, 1979).
9. C. St. J.A. Nash-Williams, Decomposition of finite graphs into forests, J. London Math. Soc. 39 (1964) 12.
10. G. Ringel, private communication.