%0 Journal Article
%T 最大度为7的平面图全染色<br>Total coloring of planar graphs with maximum degree seven
%A 王晓丽
%A 王慧娟
%A 刘彬&lt
%A br&gt
%A WANG Xiao-li
%A WANG Hui-juan
%A LIU Bin
%J 山东大学学报（理学版）
%D 2017
%R 10.6040/j.issn.1671-9352.0.2016.363
%X 摘要： 假设图G是最大度为7的平面图。 利用权转移的方法证明了,如果图G中弦5-圈和弦6-圈不相邻,那么图G的全色数是Δ+1。<br>Abstract: Let G be a planar graph with maximum degree Δ≥7. It is proved that if chordal 5-cycles of G are not adjacent to chordal 6-cycles, then its total chromatic number is Δ+1 by the discharging method
%K 平面图
%K 全染色
%K 圈
%K 权转移
%K &lt
%K br&gt
%K total coloring
%K cycle
%K planar graph
%K discharging
%U http://lxbwk.njournal.sdu.edu.cn/CN/10.6040/j.issn.1671-9352.0.2016.363