Related references
Note: Only part of the references are listed.Total coloring of recursive maximal planar graphs
Yangyang Zhou et al.
THEORETICAL COMPUTER SCIENCE (2022)
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
Enqiang Zhu et al.
DISCRETE APPLIED MATHEMATICS (2017)
On purely tree-colorable planar graphs
Jin Xu et al.
INFORMATION PROCESSING LETTERS (2016)
Total coloring of planar graphs without 6-cycles
Jianfeng Hou et al.
DISCRETE APPLIED MATHEMATICS (2011)
(Δ+1)-total-colorability of plane graphs of maximum degree Δ ≥ 6 with neither chordal 5-cycle nor chordal 6-cycle
Qian Wu et al.
INFORMATION PROCESSING LETTERS (2011)
LOCAL CONDITION FOR PLANAR GRAPHS OF MAXIMUM DEGREE 6 TO BE TOTAL 8-COLORABLE
Nicolas Roussel
TAIWANESE JOURNAL OF MATHEMATICS (2011)
Total colorings of planar graphs without adjacent triangles
Xiang-Yong Sun et al.
DISCRETE MATHEMATICS (2009)
On total chromatic number of planar graphs without 4-cycles
Ying-qian Wang et al.
SCIENCE IN CHINA SERIES A-MATHEMATICS (2007)
Share Paper
