On total 9-coloring planar graphs of maximum degree seven

Journal of Graph Theory

Volumn 31, Issue 1, 1999, Pages 67-73

  Sanders, Daniel P ^a   Zhao, Yue ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b Tulane University   (United States)

Author keywords

Discharging; Graph coloring; Graphs on surfaces

Indexed keywords

EID: 0033459911     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199905)31:1<67::AID-JGT6>3.0.CO;2-C     Document Type: Article

References (10)

1. L. Andersen, Total colouring of simple graphs (in Danish), Master's thesis, University of Aalborg, 1993.
2. M. Behzad, Graphs and their chromatic numbers, Doctoral thesis, Michigan State University, 1965.
3. O. V. Borodin, On the total coloring of planar graphs, J Reine Angew Math 394 (1989), 180-185.
4. T. R. Jensen and B. Toft, "Total coloring," Graph Coloring Problems, Wiley (1995), 86-89.
5. A. V. Kostochka, The total coloring of a multigraph with maximal degree 4, Discrete Math 17 (1977), 161-163.
6. A. V. Kostochka, Exact upper bound for the total chromatic number of a graph (in Russian), in Proc 24th Int Wiss Koll Tech Hochsch Ilmenau (1979), 33-36.
7. M. Rosenfeld, On the total coloring of certain graphs, Israel J Math 9 (1971), 396-402.
8. N. Vijayaditya, On total chromatic number of a graph, J London Math Soc 3 (1971), 405-408.
9. V. G. Vizing, On an estimate of the chromatic class of a p-graph (in Russian), Metody Diskret Analiz 3 (1964), 25-30.
10. H. P. Yap, Total-colourings of graphs, manuscript, 1989.