Abstract
The article shrinks the Δ = 6 hole that exists in the family of planar graphs which satisfy the total coloring conjecture. Let G be a planar graph. If \({v_n^k}\) represents the number of vertices of degree n which lie on k distinct 3-cycles, for \({n, k \in \mathbb{N}}\) , then the conjecture is true for planar graphs which satisfy \({v_5^4 +2(v_5^{5^+} +v_6^4) +3v_6^5 +4v_6^{6^+} < 24}\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Behzad, M.: Graphs and their chromatic numbers, Ph.D. thesis, Michigan State University, p. 69 (1965)
Borodin O.V.: On the total coloring of planar graphs. J. Reine Angew. Math. 394, 180–185 (1989)
Kostochka A.V.: The total coloring of a multigraph with maximal degree 4. Discret. Math. 17(2), 161–163 (1977)
Kostochka A.V.: The total chromatic number of any multigraph with maximum degree five is at most seven. Discret. Math. 162(1–3), 199–214 (1996)
Sanders D.P., Zhao Y: On total 9-coloring planar graphs of maximum degree seven. J. Graph Theory 31(1), 67–73 (1999)
Sun X.-Y., Wu J.-L., Wu Y.-W., Hou J.-F.: Total colorings of planar graphs without adjacent triangles. Discret. Math. 309(1), 202–206 (2009)
Tommy, R.J., Toft, B.: Graph Coloring Problems, Wiley-Interscience Series in Discrete Mathematics and Optimization, A Wiley-Interscience Publication. Wiley, New York (1995)
Vijayaditya N.: On total chromatic number of a graph. J. London Math. Soc. 3(2), 405–408 (1971)
Vizing V.G.: The chromatic class of a multigraph. Kibernetika (Kiev) 1965(3), 29–39 (1965)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Leidner, M. A Larger Family of Planar Graphs that Satisfy the Total Coloring Conjecture. Graphs and Combinatorics 30, 377–388 (2014). https://doi.org/10.1007/s00373-012-1278-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-012-1278-4