Total coloring of embedded graphs of maximum degree at least ten
Articles
First Online:
Received:
Accepted:
Abstract
A total k-coloring of a graph G is a coloring of V(G) ∪ E(G) using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number χ″(G) is the smallest integer k such that G has a total k-coloring. In this paper, it is proved that the total chromatic number of any graph G embedded in a surface Σ of Euler characteristic χ(Σ) ⩾ 0 is Δ(G) + 1 if Δ(G) ⩾ 10, where Δ(G) denotes the maximum degree of G.
Keywords
surface Euler characteristic total coloring total chromatic numberMSC(2000)
05C15Preview
Unable to display preview. Download preview PDF.
References
- 1.Behzad M. Graphs and their chromatic number. PhD Thesis. Michigan State University, 1965Google Scholar
- 2.Borodin O V. On the total coloring of planar graphs. J Reine Angew Math, 1989, 394: 180–185MATHMathSciNetGoogle Scholar
- 3.Borodin O V, Kostochka A V, Woodall D R. Total colourings of planar graphs with large maximum degree. J Graph Theory, 1997, 26: 53–59MATHCrossRefMathSciNetGoogle Scholar
- 4.Borodin O V, Kostochka A V, Woodall D R. Total colourings of planar graphs with large girth. European J Combin, 1998, 19: 19–24MATHCrossRefMathSciNetGoogle Scholar
- 5.Hou J, Liu G, Cai J. List edge and list total colorings of planar graphs without 4-cycles. Theoret Comput Sci, 2006, 369: 250–255MATHCrossRefMathSciNetGoogle Scholar
- 6.Hou J, Zhu Y, Liu G, et al. Total colorings of planar graphs without small cycles. Graphs Combin, 2008, 24: 91–100MATHCrossRefMathSciNetGoogle Scholar
- 7.Kostochka A V. The total coloring of a multigraph with maximum degree 4. Discrete Math, 1977, 17: 161–163MATHCrossRefMathSciNetGoogle Scholar
- 8.Kostochka A V. Upper bounds of chromatic functions on graphs (in Russian). PhD Thesis. Novosibirsk, 1978Google Scholar
- 9.Kostochka A V. The total chromatic number of any multigraph with maximum degree five is at most seven. Discrete Math, 1996, 162: 199–214MATHCrossRefMathSciNetGoogle Scholar
- 10.Rosenfeld M. On the total coloring of certain graphs. Israel J Math, 1971, 9: 396–402MATHCrossRefMathSciNetGoogle Scholar
- 11.Sanchez-Arroyo A. Determining the total coloring number is NP-hard. Discrete Math, 1989, 78: 315–319MATHCrossRefMathSciNetGoogle Scholar
- 12.Sanders D P, Zhao Y. On total 9-coloring planar graphs of maximum degree seven. J Graph Theory, 1999, 31: 67–73MATHCrossRefMathSciNetGoogle Scholar
- 13.Vijayaditya N. On total chromatic number of a graph. J London Math Soc, 1971, 3: 405–408MATHCrossRefMathSciNetGoogle Scholar
- 14.Vizing V G. Some unsolved problems in graph theory (in Russian). Uspekhi Mat Nauk, 1968, 23: 117–134MATHMathSciNetGoogle Scholar
- 15.Wang P, Wu J. A note on total colorings of planar graphs without 4-cycles. Discuss Math Graph Theory, 2004, 24: 125–135MATHMathSciNetGoogle Scholar
- 16.Wang W. Total chromatic number of planar graphs with maximum degree ten. J Graph Theory, 2007, 54: 91–102MATHCrossRefMathSciNetGoogle Scholar
- 17.Wu J, Wang P. List-edge and list-total colorings of graphs embedded on hyperbolic surfaces. Discrete Math, 2008, 308: 6210–6215MATHCrossRefMathSciNetGoogle Scholar
- 18.Yap H P. Total colourings of graphs. In: Lecture Notes in Mathematics, vol. 1623. London: Springer-Verlag, 1996MATHGoogle Scholar
- 19.Zhao Y. On the total coloring of graphs embeddable in surfaces. J London Math Soc, 1999, 60: 333–343MATHCrossRefMathSciNetGoogle Scholar
Copyright information
© Science China Press and Springer-Verlag Berlin Heidelberg 2010