Colouring graphs with bounded generalized colouring number

Discrete Mathematics

Volumn 309, Issue 18, 2009, Pages 5562-5568

  Zhu, Xuding ^a,b  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

^b NATIONAL CENTER FOR THEORETICAL SCIENCES   (Taiwan)

Author keywords

Colouring of graphs; Generalized colouring number; Greatest reduced average degree; Tree depth

Indexed keywords

COLOURING OF GRAPHS; GENERALIZED COLOURING; GENERALIZED COLOURING NUMBER; GRAPH G; GREATEST REDUCED AVERAGE DEGREE; POSITIVE INTEGERS; SUBGRAPHS; TREE DEPTH; UPPER BOUND;

COLOR; EQUIVALENCE CLASSES;

GRAPH THEORY;

EID: 69549124397     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2008.03.024     Document Type: Article

References (12)

1. Chen G., and Schelp R.H. Graphs with linearly bounded Ramsey numbers. J. Combin. Theory Ser. B 57 (1993) 138-149
2. DeVos M., Ding G., Oporowski B., Sanders D.P., Reed B., Seymour P.D., and Vertigan D. Excluding any graph as a minor allows a low tree-width 2-coloring. J. Combin. Theory Ser. B 91 (2004) 25-41
3. Kierstead H.A. A simple competitive graph coloring algorithm. J. Combin. Theory Ser. B 78 (2000) 57-68
4. Kierstead H.A., and Trotter W.T. Planar graph coloring with an uncooperative partner. J. Graph Theory 18 (1994) 569-584
5. Kierstead H.A., and Yang D. Orderings on graphs and game coloring number. Order 20 (2003) 255-264
6. H.A. Kierstead, D. Yang, General coloring numbers, grad, and nonrepetitive colorings of graphs, 2007, manuscript
7. Kostochka A. On the minimum Hadwiger number for graphs with given average degree. Metody Diskret. Analiz. 38 (1982) 37-58 (in Russian); English translation: AMS Transl. (2), 132 (1986) 15-32
8. Nešetřil J., and Ossona de Mendez P. Tree depth, subgraph coloring and homomorphism bounds. European J. Combin. 27 6 (2006) 1022-1041
9. J. Nešetřil, P. Ossona de Mendez, Grad and classes with bounded expansion I. Decompositions. KAM-DIMATIA Series, no. 2005-739
10. J. Nešetřil, P. Ossona de Mendez, Grad and Classes with Bounded Expansion II. Algorithmic Aspects, KAM-DIMATIA Series, no. 2005-740
11. Nešetřil J., and Ossona de Mendez P. Linear time low tree-width partitions and algorithmic consequences STOC'06. Proceedings of the 38th Annual ACM Symposium on Theory of Computing (2006), ACM Press 39-400
12. Thomason A. An extremal funcion for contractions of graphs. Math. Proc. Cambridge Philos. Soc. 95 (1984) 261-265