DP-4-colorability of two classes of planar graphs

DOI10.1016/j.disc.2019.05.032zbMath1419.05068arXiv1811.02920OpenAlexW2963121837WikidataQ127576599 ScholiaQ127576599MaRDI QIDQ2324485

Xiangqian Zhou, Lily Chen, Ren Zhao, Gexin Yu, Runrun Liu

Publication date: 11 September 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.02920

zbMATH Keywords

DP-coloringseparating cyclesidentify

Mathematics Subject Classification ID

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

Related Items

Upper bound for DP-chromatic number of a graph ⋮ Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate ⋮ Planar graphs without normally adjacent short cycles ⋮ Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable ⋮ Planar graphs without 7-cycles and butterflies are DP-4-colorable ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ 不含带弦6-圈和项链图的平面图是DP-4-可染的 ⋮ Unnamed Item ⋮ DP-4-coloring of planar graphs with some restrictions on cycles ⋮ DP-3-coloring of planar graphs without certain cycles ⋮ DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles ⋮ Relaxed DP-3-coloring of planar graphs without some cycles ⋮ DP-coloring on planar graphs without given adjacent short cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Planar graphs without cycles of specific lengths
• The 4-choosability of plane graphs without 4-cycles
• Choosability and edge choosability of planar graphs without five cycles
• A not 3-choosable planar graph without 3-cycles
• Colorings of plane graphs: a survey