Total coloring of planar graphs with maximum degree \(7\)

DOI10.1016/J.IPL.2011.07.012zbMath1260.05064OpenAlexW2097053745MaRDI QIDQ1944191

Bing Wang, Jian Liang Wu

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.07.012

zbMATH Keywords

cyclecombinatorial problemsplanar graphtotal coloring

Mathematics Subject Classification ID

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

Related Items (6)

Total coloring of planar graphs without chordal 7-cycles ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ Total colorings-a survey ⋮ A note on the total coloring of planar graphs without adjacent 4-cycles ⋮ Total colorings of planar graphs without intersecting 5-cycles ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Total coloring of planar graphs of maximum degree eight
• Total colorings of planar graphs with maximum degree at least 8
• The total chromatic number of any multigraph with maximum degree five is at most seven
• List edge and list total colourings of multigraphs
• 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
• Total colorings of planar graphs with large maximum degree
• A note on total colorings of planar graphs without 4-cycles

This page was built for publication: Total coloring of planar graphs with maximum degree \(7\)