Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable

DOI10.1007/s00373-021-02407-5zbMath1479.05114OpenAlexW4200043039MaRDI QIDQ2062893

Jian-Bo Lv

Publication date: 3 January 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02407-5

zbMATH Keywords

planar graphsDP-coloring3-choosable

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• List colourings of planar graphs
• DP-3-coloring of some planar graphs
• Colorings of plane graphs: a survey
• The asymptotic behavior of the correspondence chromatic number
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings

This page was built for publication: Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable