(3, 1)^(*)-choosability of plane graphs without adjacent single cycles  

作　　者：Jufeng ZHANG Min CHEN Yiqiao WANG 

机构地区：[1]College of Mathematics and Computer Science,Zhejiang Normal University,Jinhua 321004,China [2]School of Management,Beijing University of Chinese Medicine,Beijing 100029,China

出　　处：《Frontiers of Mathematics in China》2024年第2期101-115,共15页中国高等学校学术文摘·数学（英文）

摘　　要：Given a list assignment of L to graph G,assign a list L(υ)of colors to each υ∈V(G).An(L,d)^(*)-coloring is a mapping π that assigns a color π(υ)∈L(υ)to each vertex υ∈V(G)such that at most d neighbors of υ receive the color υ.If there exists an(L,d)^(*)-coloring for every list assignment L with|L(υ)|≥k for all υ∈ V(G),then G is called to be(k,d)^(*)-choosable.In this paper,we prove every planar graph G without adjacent k-cycles is(3,1)^(*)-choosable,where k ∈{3,4,5}.

关 键 词：Plane graph improper list coloring (k d)^(*)-choosable CYCLE 

分 类 号：O15[理学—数学]