Total coloring of planar graphs with 7-cycles containing at most two chords

DOI10.1016/J.TCS.2013.08.019zbMath1305.05086OpenAlexW2005216870MaRDI QIDQ391771

Renyu Xu, 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.08.019

zbMATH Keywords

cycleplanar 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 (3)

Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ Total colorings-a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Total coloring of planar graphs without chordal short cycles
• Total coloring of planar graphs without adjacent short cycles
• Total coloring of planar graphs of maximum degree eight
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
• 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

This page was built for publication: Total coloring of planar graphs with 7-cycles containing at most two chords