3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles

DOI10.1137/080743020zbMath1223.05069OpenAlexW2071204644MaRDI QIDQ3008018

Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski

Publication date: 17 June 2011

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

Full work available at URL: https://semanticscholar.org/paper/3d94f7873cd1f6b5196c1bd8e17b0fa5737e7eb8

zbMATH Keywords

triangle-free graphplanar graphcoloringchoosabilitylist coloring

Mathematics Subject Classification ID

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

Related Items (7)

Planar graphs without normally adjacent short cycles ⋮ Weak degeneracy of planar graphs and locally planar graphs ⋮ 3-list-coloring planar graphs of girth 4 ⋮ Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ DP-3-coloring of planar graphs without certain cycles ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs ⋮ Facial unique-maximum colorings of plane graphs with restriction on big vertices

This page was built for publication: 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles