没有两个子图的平面图的DP-染色  

DP-4-colorability of Planar Graphs Without Two Subgraphs

作　　者：田昉于 李相文[1] TIAN Fangyu;LI Xiangwen(School of Mathematics and Statistics,Central China Normal University,Wuhan,Hubei,430079,P.R.China)

机构地区：[1]华中师范大学数学与统计学院,湖北武汉430079

出　　处：《数学进展》2024年第4期731-746,共16页Advances in Mathematics（China）

基　　金：Supported by NSFC (No.12031018)。

摘　　要：本文证明两个结论:(1)没有相交3-圈的平面图是DP-4-可染的,这个结果改进了[SIAM J.Discrete Math.,2002,15(4):538-545]的结果:任何没有相交3-圈的平面图是4-可选的;(2)任何没有相邻3-圈且没有4-圈相邻两个相交3-圈的平面图是DP-4-可选的,这个结果改进了[Discrete Math.,2019,342(3):623-627],[Graph Combin.,2019,35(3):707-718]以及[Discrete Math.,2021,344(11):Paper No.112568,10 pp.]的结果.In this paper,we prove two results:(1)every planar graph without intersecting triangles is DP-4-colorable,which improves the early result of[SIAM J.Discrete Math.,2002,15(4):538-545]that every planar graph without intersecting triangles is 4-choosable;(2)every planar graph without adjacent triangles and without one 4-cycle adjacent two intersecting triangles is DP-4-colorable,which improves early results of[Discrete Math.,2019,342(3):623-627],[Graphs Combin.,2019,35(3):707-718]and[Discrete Math.,2021,344(11):Paper No.112568,10 pp.].

关 键 词：平面图 列表染色 DP-染色 

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