Defective 3-paintability of planar graphs

zbMath1391.05109arXiv1706.01599MaRDI QIDQ1753126

Tomasz Krawczyk, Ming Han, Xuding Zhu, Grzegorz Gutowski

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

planar graph\(d\)-defective painting gamedefective paintability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Every planar graph is 1-defective \((9,2)\)-paintable ⋮ Decomposing planar graphs into graphs with degree restrictions ⋮ Weak (2, 3)-decomposition of planar graphs ⋮ The Alon-Tarsi number of a planar graph minus a matching ⋮ The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)

Cites Work

• Unnamed Item
• List colourings of planar graphs
• Planar graphs are 1-relaxed, 4-choosable
• Every planar graph is 5-choosable
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• List Improper Colourings of Planar Graphs
• Locally planar graphs are 2-defective 4-paintable

This page was built for publication: Defective 3-paintability of planar graphs