Total-coloring of sparse graphs with maximum degree 6

DOI10.1007/s10255-021-1039-3zbMath1482.05098OpenAlexW3207085077MaRDI QIDQ2240657

Jichang Wu, Fei Jing, Yu-Lin Chang, Guang-Hui Wang

Publication date: 4 November 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-021-1039-3

zbMATH Keywords

discharging methodtotal-coloringmaximum average degree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Related Items (1)

Total colorings-a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Local condition for planar graphs of maximum degree 6 to be total 8-colorable
• The total coloring of a multigraph with maximal degree 4
• A bound on the total chromatic number
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Planar graphs of maximum degree seven are Class I
• On total colourings of graphs
• An upper bound for the total chromatic number
• On the total coloring of certain graphs
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• An Improvement of Hind's Upper Bound on the Total Chromatic Number
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• On Total Chromatic Number of a Graph

This page was built for publication: Total-coloring of sparse graphs with maximum degree 6