On star coloring of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2204, Issue , 2001, Pages 140-153

  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

Acyclic coloring; Graphs; Proper coloring; Star coloring; Treewidth; Vertex coloring

Indexed keywords

COLORING; GRAPHIC METHODS; STARS;

ACYCLIC COLORING; GRAPHS; PROPER COLORING; STAR-COLORING; TREE-WIDTH; VERTEX COLORING;

TREES (MATHEMATICS);

EID: 84945291167     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45477-2_14     Document Type: Conference Paper

References (12)

1. N. Alon, C. McDiarmid, and B. Reed. Acyclic colourings of graphs. Random Structures and Algorithms, 2: 277-288, 1990.
2. O.V. Borodin, A.V. Kostochka, A. Raspaud, and E. Sopena. Acyclic fc-strong coloring of maps on surfaces. Mathematical Notes, 67 (1): 29-35, 2000.
3. O.V. Borodin, A.V. Kostochka, and D.R. Woodall. Acyclic colourings of planar graphs with large girth. J. London Math. Soc., 60 (2): 344-352, 1999.
4. A. Brandstädt, V.B. Le, and J.P. Spinrad. Graph Classes A survey. SIAM Monographs on D.M. and Applications, 1999.
5. H.L. Bodlander. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209: 1-45, 1998.
6. O.V. Borodin. On acyclic colorings of planar graphs. Discrete Mathematics, 25: 211-236, 1979.
7. G. Fertin, A. Raspaud, and B. Reed. On star coloring of graphs. Technical report, 2001.
8. B. Grünbaum. Acyclic colorings of planar graphs. Israel J. Math., 14(3): 390-408, 1973.
9. D.S. Kim, D.-Z. Du, and P.M. Pardalos. A coloring problem on the n-cube. Discrete Applied Mathematics, 103: 307-311, 2000.
10. T.A. McKee and F.R. McMorris. Topics in intersection graph theory. SIAM Monographs on D.M. and Applications, 1999.
11. N. Robertson and P.D. Seymour. Graph minors. 1. excluding a forest. J. Combin. Theory Ser. B, 35: 39-61, 1983.
12. P.-J. Wan. Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network. J. Combin. Optim., 1: 179-186, 1997.