Total coloring of planar graphs without some chordal 6-cycles

DOI10.1007/s40840-014-0036-6zbMath1310.05103OpenAlexW2052931676MaRDI QIDQ2340805

Renyu Xu, Hui-Juan Wang, Jian Liang Wu

Publication date: 21 April 2015

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-014-0036-6

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

Total coloring of planar graphs without chordal 7-cycles ⋮ A note on the minimum total coloring of planar graphs ⋮ Total colorings-a survey ⋮ The nil-graph of ideals of a commutative ring ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ On equitable colorings of sparse graphs ⋮ Color degree condition for long rainbow paths in edge-colored graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Total colorings of planar graphs with small maximum degree
• Total coloring of planar graphs without chordal short cycles
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
• Total colorings of planar graphs without small cycles
• 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
• 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 without some chordal 6-cycles