Every planar graph without adjacent cycles of length at most 8 is 3-choosable

DOI10.1016/j.ejc.2019.07.006zbMath1423.05072arXiv1804.03976OpenAlexW2963907918WikidataQ127493015 ScholiaQ127493015MaRDI QIDQ2323250

Runrun Liu, Xiangwen Li

Publication date: 30 August 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

planar graphlist assignment\(k\)-choosable graph

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 (5)

Planar graphs without normally adjacent short cycles ⋮ Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable ⋮ DP-4-coloring of planar graphs with some restrictions on cycles ⋮ DP-3-coloring of planar graphs without certain cycles ⋮ On \((3, r)\)-choosability of some planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Planar graphs without adjacent cycles of length at most seven are 3-colorable
• A sufficient condition for planar graphs to be 3-colorable
• DP-3-coloring of some planar graphs
• A sufficient condition for DP-4-colorability
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
• DP-colorings of graphs with high chromatic number
• The asymptotic behavior of the correspondence chromatic number
• Sharp Dirac's theorem for DP‐critical graphs
• On a conjecture of B. Grünbaum

This page was built for publication: Every planar graph without adjacent cycles of length at most 8 is 3-choosable