不含带弦6-圈和项链图的平面图是DP-4-可染的  

Planar Graphs Without Chordal 6-cycles and Necklaces Are DP-4-colorable

作　　者：黄丹君 齐静然 HUANG Danjun;QI Jingran(Department of Mathematics,Zhejiang Normal University,Jinhua,Zhejiang,321004,P.R.China)

机构地区：[1]浙江师范大学数学与计算机科学学院,浙江金华321004

出　　处：《数学进展》2021年第6期861-876,共16页Advances in Mathematics（China）

基　　金：Supported by Zhejiang Provincial Natural Science Foundation of China(No.LY18A010014)。

摘　　要：DP染色是Dvorák和Postle在[J.Combin.Theory Ser.B,2018,129:38-54]中提出的,它是列表染色的一个推广.2018年,Kim和Ozeki证明了不含k-圈的平面图是DP-4-可染的,这里k=3,4,5,6.本文改进以上结果给出平面图是DP-4-可染的一个充分条件,证明不含带弦6-圈和项链图的平面图是DP-4-可染的.DP-coloring(also known as correspondence coloring)introduced by Dvorák and Postle[J.Combin.Theory Ser.B,2018,129:38-54]is a generalization of list coloring.In 2018,Kim and Ozeki showed that planar graphs without k-cycles are DP-4-colorable for each k=3,4,5,6.In this paper,we improve their results by giving a sufficient condition for planar graphs to be DP-4-colorable,i.e.,we show that planar graphs without chordal 6-cycles and necklaces are DP-4-colorable.

关 键 词：DP染色数 平面图 圈 弦 

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