Total colorings of planar graphs with small maximum degree

zbMATH Open1270.05048MaRDI QIDQ360968FDOQ360968

Jian-Liang Wu, Si-Feng Tian, Bing Wang

Publication date: 28 August 2013

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

Full work available at URL: http://math.usm.my/bulletin/html/vol36_3_21.html

Recommendations

• Total colorings of planar graphs without small cycles
• Total chromatic number of planar graphs with few short cycles
• Total colourings of planar graphs with large girth
• A note on total colorings of planar graphs without 4-cycles
• Total coloring of planar graphs without short cycles

zbMATH Keywords

cyclegirthmaximum degreeplanar graphtotal coloringtotal chromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Cited In (11)

• Randomly coloring planar graphs with fewer colors than the maximum degree
• Total colorings-a survey
• Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
• On equitable colorings of sparse graphs
• The nil-graph of ideals of a commutative ring
• A note on the minimum total coloring of planar graphs
• Minimum total coloring of planar graphs with maximum degree 8
• Color degree condition for long rainbow paths in edge-colored graphs
• Total coloring of planar graphs without some chordal 6-cycles
• The total coloring of planar graphs with a few \(3\)-faces incidents with vertex
• Total coloring of recursive maximal planar graphs

This page was built for publication: Total colorings of planar graphs with small maximum degree

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