On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles |
| |
| Authors: | Lan Shen Yingqian Wang Weifan Wang Ko-Wei Lih |
| |
| Institution: | 1. College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Zhejiang Jinhua 321004, China;2. Institute of Mathematics, Academia Sinica, Nankang, Taipei 11529, Taiwan |
| |
| Abstract: | Recently, Kowalik, Sereni, and ?krekovski proved that planar graphs with maximum degree 9 are 10-totally colorable. This work proves that planar graphs with maximum degree 8 and without intersecting triangles are 9-totally colorable. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
