A larger family of planar graphs that satisfy the total coloring conjecture

DOI10.1007/s00373-012-1278-4zbMath1298.05088OpenAlexW2067189591WikidataQ123020927 ScholiaQ123020927MaRDI QIDQ742577

Maxfield Leidner

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1278-4

zbMATH Keywords

planar graphstotal coloringdischarging

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items

Total chromatic number of honeycomb network ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ Total colorings-a survey ⋮ Total colorings of graphs with minimum sum of colors ⋮ Total chromatic sum for trees

Cites Work

• Total colorings of planar graphs without adjacent triangles
• The total coloring of a multigraph with maximal degree 4
• The total chromatic number of any multigraph with maximum degree five is at most seven
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• On Total Chromatic Number of a Graph
• Unnamed Item
• Unnamed Item

This page was built for publication: A larger family of planar graphs that satisfy the total coloring conjecture