无4-，6-圈的可平面图的3-可选性

摘要

We call a graph G (V,E)is k-choosable if every vertex of G can be properly colored whenever every vertex of G has a list of at least k available colors. In this paper,we prove that every planar graph without 4-,6-cycles,adjacent 5-cycles or triangles at distance less than 4 is 3-choosable.%令G=（V，E）是一个有限的平面图，当给G中的每个点至少k个可用色时，若G可以被正常染色，则称G是k-可选的。证明无4-，6-圈，5-圈与5-圈不相邻且三角形距离大于等于3的可平面图是3-可选的。