| 最大度为10的图的列表全可染色问题 |
| |
| 引用本文： | 孙燕玲.最大度为10的图的列表全可染色问题[J].嘉兴学院学报,2014,26(6):64-67. |
| |
| 作者姓名： | 孙燕玲 |
| |
| 作者单位： | 张店区第七中学,山东淄博,255000 |
| |
| 摘 要： | 对于一个给定的最大度为10的平面图G,若图G不含相邻的三角形,则G是11-列表全可染色的,更进一步证明了列表全染色的猜想.
|
| 关 键 词： | 列表全可染 平面图 最大度 相邻三角形 |
Total Choosability of Planar Graphs with Maximum Degree 10 |
| |
| Sun Yanling.Total Choosability of Planar Graphs with Maximum Degree 10[J].Journal of Jiaxing College,2014,26(6):64-67. |
| |
| Authors: | Sun Yanling |
| |
| Institution: | Sun Yanling (Zhangdian No. 7 Middle School,Zibo, Shandong 255000) |
| |
| Abstract: | For a given planar graph G with maximum degree 10 and without adjacent triangles,it was proved that G was total-11-choosable,and the famous list total coloring conjecture was further proved. |
| |
| Keywords: | list total coloring planar graphs maximum degree adjacent triangles |
| 本文献已被 维普 等数据库收录！ |
|
