Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Math. 308 (2008) 496-513] (DOI:10.1016/j.disc.2007.03.034);(p, 1)-Total labelling of graphs

Discrete Mathematics

Volumn 308, Issue 4, 2008, Pages 496-513

  Havet, Frédéric ^a   Yu, Min Li ^b  

^a INRIA   (France)

^b UNIVERSITY OF THE FRASER VALLEY   (Canada)

Author keywords

(p, 1) total labelling

Indexed keywords

EID: 36348965330     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2010.04.001     Document Type: Erratum

References (10)

1. Bezhad M., Chartand G., and Cooper J.K. The colour numbers of complete graphs. J. London Math. Soc. 42 (1967) 226-228
2. Chang G.J., Ke W.-T., Kuo D., Liu D.D.-F., and Yeh R.K. On L (d, 1)-labellings of graphs. Discrete Math. 220 (2000) 57-66
3. Galvin F. The list chromatic index of a bipartite multigraph. J. Combin. Theory Ser. B 63 (1995) 153-158
4. Griggs J.R., and Yeh R.K. Labelling graphs with a condition at distance two. SIAM J. Discrete Math. 5 (1992) 586-595
5. F. Havet, S. Thomassé, Complexity of (p, 1)-total labelling, manuscript, 2006.
6. Hind H., Molloy M., and Reed B. Total colouring with Δ + poly (log Δ) colours. SIAM J. Comput. 28 (1998)
7. McDiarmid C., and Reed B. On total colourings of graphs. J. Combin. Theory Ser. B 57 (1993) 122-130
8. Molloy M., and Reed B. A bound on the total chromatic number. Combinatorica 18 2 (1998) 241-280
9. Molloy M., and Reed B. Graph Colouring and the Probabilistic Method. Algorithms and Combinatorics vol. 23 (2002), Springer, Berlin
10. n and related graphs. SIAM J. Discrete Math. 8 (1995) 449-506