Theoretical Computer ScienceVolume 476, 11 March 2013, Pages 16-23Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords☆Author links open overlay panelJian Chang a, Hui-Juan Wang b, Jian-Liang Wu b, Yong-Ga A aShow moreShareCitehttps://doi.org/10.1016/j.tcs.2013.01.015Get rights and contentUnder an Elsevier user licenseopen archiveAbstractPlanar graphs with maximum degree Δ≥8 and without 5-cycles with two chords are proved to be totally (Δ+1)-colorable.Previous article in issueNext article in issueKeywordsPlanar graphTotal coloringCycleRecommended articlesCited by (0)☆This work is supported by research grants NSFC (11271006, 11201440).Copyright © 2013 Published by Elsevier B.V.
