Local condition for planar graphs of maximum degree 6 to be total 8-colorable

DOI10.11650/TWJM/1500406163zbMATH Open1284.05074OpenAlexW4233982451MaRDI QIDQ636063FDOQ636063

Authors: Nicolas Roussel 

Publication date: 25 August 2011

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500406163

Recommendations

• Total coloring of planar graphs of maximum degree eight
• Total coloring of planar graphs with maximum degree 8
• Total colorings of planar graphs with maximum degree 6 and without adjacent chordal 6-cycles
• A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
• Total colorings of planar graphs without 6-cycles and adjacent 5-cycles

zbMATH Keywords

maximum degreeplanar graphstotal coloringmissing cycles

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (05C99)

Cited In (5)

• Total colorings-a survey
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
• Total coloring of planar graphs without short cycles
• A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
• Total-coloring of sparse graphs with maximum degree 6

This page was built for publication: Local condition for planar graphs of maximum degree 6 to be total 8-colorable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q636063)