Planar graphs are 1-relaxed, 4-choosable

DOI10.1016/J.EJC.2009.11.013zbMATH Open1221.05077OpenAlexW2093490044MaRDI QIDQ976159FDOQ976159

Authors: William Cushing, H. A. Kierstead 

Publication date: 17 June 2010

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.11.013

Recommendations

• A local condition for planar graphs to be 4-choosable
• \((4,1)^*\)-choosability of planar graphs
• The 4-choosability of plane graphs without 4-cycles
• A note on the not 3-choosability of some families of planar graphs
• List colourings of planar graphs

Mathematics Subject Classification ID

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

Cites Work

• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Title not available (Why is that?)
• Title not available (Why is that?)
• Every planar graph is 5-choosable
• Title not available (Why is that?)
• List Improper Colourings of Planar Graphs
• List colourings of planar graphs

Cited In (31)

• Every planar graph is 1-defective \((9,2)\)-paintable
• Locally planar graphs are 2-defective 4-paintable
• On generalized choice and coloring numbers
• The Alon–Tarsi number of planar graphs revisited
• \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles
• Acyclic improper choosability of subcubic graphs
• Defective 3-paintability of planar graphs
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
• Islands in Graphs on Surfaces
• The Alon-Tarsi number of a planar graph minus a matching
• Decomposition of toroidal graphs without some subgraphs
• On 2-defective DP-colorings of sparse graphs
• Decomposing planar graphs into graphs with degree restrictions
• A note on Alon-Tarsi number of Halin graphs
• On the Alon-Tarsi number of semi-strong product of graphs
• The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
• A \((3,1)^\ast\)-choosable theorem on planar graphs
• Weak (2, 3)-decomposition of planar graphs
• Equitable defective coloring of sparse planar graphs
• Sparse critical graphs for defective DP-colorings
• Defective and clustered choosability of sparse graphs
• A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles
• Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions
• Improper Choosability and Property B
• Colouring planar graphs with bounded monochromatic components
• A note on relaxed equitable coloring of graphs
• The Alon-Tarsi number of \(K_5\)-minor-free graphs
• Decomposition of planar graphs with forbidden configurations
• Relaxed equitable colorings of planar graphs with girth at least 8
• Defective DP-colorings of sparse multigraphs
• Defective DP-colorings of sparse simple graphs

This page was built for publication: Planar graphs are 1-relaxed, 4-choosable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976159)