Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable

DOI10.1007/s40840-019-00800-1zbMath1437.05079OpenAlexW2957147986WikidataQ127519108 ScholiaQ127519108MaRDI QIDQ1988544

Pongpat Sittitrai, Kittikorn Nakprasit

Publication date: 23 April 2020

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-019-00800-1

zbMATH Keywords

cycleplanar graphlist coloringDP-coloring

Mathematics Subject Classification ID

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

Related Items (7)

A sufficient condition for planar graphs to be DP-4-colorable ⋮ A generalization of some results on list coloring and DP-coloring ⋮ Variable degeneracy on toroidal graphs ⋮ 不含带弦6-圈和项链图的平面图是DP-4-可染的 ⋮ 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

• A sufficient condition for a planar graph to be 4-choosable
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• List colourings of planar graphs
• Every planar graph is 5-choosable
• A sufficient condition for DP-4-colorability
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
• On DP-coloring of graphs and multigraphs
• The asymptotic behavior of the correspondence chromatic number
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable