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

DOI10.11845/sxjz.2020060bOpenAlexW3216990132MaRDI QIDQ5038381

Jingran Qi, Danjun Huang

Publication date: 30 September 2022

Full work available at URL: http://www.oaj.pku.edu.cn/sxjz/CN/10.11845/sxjz.2020060b

zbMATH Keywords

cycleplanar graphchordDP-chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• List colourings of planar graphs
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• Choosability and edge choosability of planar graphs without five cycles
• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
• Planar graphs without chordal 6-cycles are 4-choosable
• A sufficient condition for DP-4-colorability
• On structure of some plane graphs with application to choosability
• DP-4-coloring of planar graphs with some restrictions on cycles
• Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
• Planar graphs without 7-cycles and butterflies are DP-4-colorable
• DP-4-colorability of planar graphs without adjacent cycles of given length
• DP-4-colorability of two classes of planar graphs
• Planar Graphs without 7-Cycles Are 4-Choosable
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

This page was built for publication: 不含带弦6-圈和项链图的平面图是DP-4-可染的