(3, 1)*-Choosability of graphs of nonnegative characteristic without intersecting short cycles

Proceedings Mathematical Sciences

Haihui Zhang¹ 

[1] School of Mathematical Science, Huaiyin Normal University, Changjiang West Road, Huaian, Jiangsu 00, China$$

关键词: Graph;    defective choosability;    characteristic;    intersecting cycles.;   

DOI  :  

学科分类：数学（综合）

来源: Indian Academy of Sciences

【 摘 要 】

A graph 𝐺 is called (𝑘, 𝑑)*-choosable if for every list assignment 𝐿 satisfying $|L(v)|geq k$ for all $v in V (G)$, there is an 𝐿-coloring of 𝐺 such that each vertex of 𝐺 has at most 𝑑 neighbors colored with the same color as itself. In this paper, it is proved that every graph of nonnegative characteristic without intersecting 𝑖-cycles for all 𝑖 = 3, 4, 5 is (3, 1)*-choosable.

【 授权许可】

Unknown