Total coloring of embedded graphs with maximum degree at least seven

DOI10.1016/J.TCS.2013.04.030zbMath1370.05074OpenAlexW2092248620MaRDI QIDQ391777

Gui Zhen Liu, Bin Liu, Hui-Juan Wang, Jian Liang Wu

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.030

zbMATH Keywords

surfaceEuler characteristictotal coloring

Mathematics Subject Classification ID

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

Related Items (4)

Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ On total colorings of some special 1-planar graphs ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ Total colorings-a survey

Cites Work

• Unnamed Item
• List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
• 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 certain graphs
• Total chromatic number of planar graphs with maximum degree ten
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• On the Total Coloring of Graphs Embeddable in Surfaces
• On Total Chromatic Number of a Graph

This page was built for publication: Total coloring of embedded graphs with maximum degree at least seven