Total colorings of planar graphs with maximum degree at least 8 |
| |
| Authors: | Lan Shen YingQian Wang |
| |
| Affiliation: | (1) College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, 321004, China |
| |
| Abstract: | ![]()
Planar graphs with maximum degree Δ ⩾ 8 and without 5- or 6-cycles with chords are proved to be (δ + 1)-totally-colorable. This work was supported by Natural Science Foundation of Ministry of Education of Zhejiang Province, China (Grant No. 20070441) |
| |
| Keywords: | planar graph total coloring maximum degree cycle chord |
| 本文献已被 SpringerLink 等数据库收录！ |
|
