平面图的3-可选性  

A note on 3-choosability of planar graphs

作　　者：李晓艳[1] 王应前[1] 

机构地区：[1]浙江师范大学数理与信息工程学院,浙江金华321004

出　　处：《浙江师范大学学报（自然科学版）》2016年第1期13-17,共5页Journal of Zhejiang Normal University:Natural Sciences

基　　金：国家自然科学基金资助项目(11271335)

摘　　要：研究了特殊平面图的3-可选性问题.应用经典的权转移方法,证明了不含4-,7-,9-圈且三角形的距离大于等于3的平面图是3-可选的.这一结果进一步拓展了平面图的3-可选的充分条件.The problem of special planar graphs of 3-choosability was studied.According to the discharging, it was showed that planar graphs with neither 4-, 7-, 9-cycles nor triangles of distance less than 3 were 3-choos-able.The result generalized the sufficient condition for the planar graphs of 3-choosability.

关 键 词：平面图 圈 距离 可选性 

分 类 号：O157.5[理学—数学]