Star coloring of graphs

Journal of Graph Theory

Volumn 47, Issue 3, 2004, Pages 163-182

  Fertin, Guillaume ^a   Raspaud, André ^b   Reed, Bruce ^c  

^a UNIVERSITÉ DE NANTES   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c SORBONNE UNIVERSITÉ   (France)

Author keywords

Graphs; Proper coloring; Star coloring; Vertex coloring

Indexed keywords

COLOR; COLORING; MATHEMATICAL MODELS; PROBABILITY; SET THEORY; TREES (MATHEMATICS);

CHROMATIC NUMBERS; PROPER COLORING; STAR COLORING; TREEWIDTH; VERTEX COLORING;

GRAPH THEORY;

EID: 7544249152     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.20029     Document Type: Article

References (16)

1. 4's. Electronic Journal of Combinatorics (1) (2004) number R26.
2. N. Alon, C. McDiarmid, and B. Reed, Acyclic coloring of graphs, Random Struc Algor 2(3) (1991), 277-288.
3. O. V. Borodin, A. V. Kostochka, A. Raspaud, and E. Sopena, Acyclic k-strong coloring of maps on surfaces, Math Notes 67(1) (2000), 29-35.
4. O. V. Borodin, A. V. Kostochka, and D. R, Woodall, Acyclic colourings of planar graphs with large girth, J Lond Math Soc 60(2) (1999), 344-352.
5. A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph Classes A survey. SIAM Monographs on D.M. and Applications, 1999.
6. H. L. Bodlander, A partial k-arboretum of graphs with bounded treewidth, Theor Comput Sci 209 (1998), 1-45.
7. B. Bollobás, Random Graphs, Academic Press, London, 1985.
8. O. V. Borodin, On acyclic coloring of planar graphs, Discrete Math 25 (1979), 211-236.
9. P. Erdös and L. Lovász, Infinite and Finite Sets, A. Hajnal et al., (Editors), North-Holland, Amsterdam, 1975.
10. G. Fertin, E. Godard, and A. Raspaud, Acyclic and k-distance coloring of the grid, Inform Process Lets 87(1) (2003), 51-58.
11. B. Grünbaum, Acyclic colorings of planar graphs, Israel J Math 14 (3) (1973), 390-408.
12. T. A. McKee and F. R. McMorris, Topics in intersection graph theory, SIAM Monographs on D.M. and Application, 1999.
13. J. Nesetril and P. Ossona de Mendez, Colorings and homomorphisms of minor closed classes, Technical report 476, Centre de Recerca Matemática, 2001.
14. N. Robertson and P. D. Seymour, Graph minors, I, excluding a forest, J Combin Theory Ser B. 35 (1983), 39-61.
15. J. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987.
16. V. G. Vizing, On an estimate of the chromatic class of a p-graph (In Russian), Diskrete Analiz 3 (1964), 25-30.