Abstract
Purchase PDF (190 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (13)
Purchase PDF (713 K)
doi:10.1016/0012-365X(95)00342-T 
Copyright © 1997 Published by Elsevier Science B.V.
Note
On incidence coloring and star arboricity of graphs
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Barry Guiduli1
Received 23 August 1994;
Abstract
In this note we show that the concept of incidence coloring introduced by Brualdi and Massey [4] is a special case of directed star arboricity, introduced by Agor and Alon [2]. A conjecture in [4] concerning asymptotics of the incidence coloring number is solved in the negative following an example in [2]. We generalize a result in [3] concerning the star arboricity of graphs to the directed case by a slight modification of their proof, to give the same asymptotic bound as in the undirected case. As a result, we get tight asymptotic bounds for the maximum incidence coloring number of a graph in terms of its degree.
Article Outline
1 Research conducted while the author was visiting the Mathematical Research Institute of the Hungarian Academy of Sciences, Budapest.
