典型文献
List 2-distance Coloring of Planar Graphs with Girth Five
文献摘要：
A 2-distance coloring of a graph is a coloring of the vertices such that two vertices at distance at most two receive distinct colors.A list assignment of a graph G is a mapping L which assigns to each vertex v a set L(v)of positive integers.The list 2-distance chromatic number of G denoted by x2l(G)is the least integer k for which G is list 2-distance k-colorable.In this paper,we prove that every planar graph with g(G)≥5 andΔ(G)≥40 is list 2-distance(Δ(G)+4)-colorable.
文献关键词：
中图分类号：
作者姓名：
Yin-dong JIN;Lian-ying MIAO
作者机构：
School of Mathematics,China University of Mining and Technology,Xuzhou 221116,China
文献出处：
引用格式：
[1]Yin-dong JIN;Lian-ying MIAO-.List 2-distance Coloring of Planar Graphs with Girth Five)[J].应用数学学报（英文版）,2022(03):540-548
A类：
x2l,colorable
B类：
List,distance,Coloring,Planar,Graphs,Girth,Five,coloring,graph,vertices,such,that,two,most,receive,distinct,colors,list,assignment,mapping,which,assigns,each,vertex,set,positive,integers,chromatic,number,denoted,by,least,In,this,paper,we,prove,every,planar,+4
AB值：
0.573225
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
