Planar graphs are 1-relaxed, 4-choosable

DOI10.1016/J.EJC.2009.11.013MaRDI QIDQ976159zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Every planar graph is 5-choosable
• List Improper Colourings of Planar Graphs
• List colourings of planar graphs

Cited in

(32)

• Every planar graph is 1-defective \((9,2)\)-paintable
• On generalized choice and coloring numbers
• Improper choosability and property B
• Locally planar graphs are 2-defective 4-paintable
• 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
• The Alon-Tarsi number of a planar graph minus a matching
• On 2-defective DP-colorings of sparse graphs
• Decomposition of toroidal graphs without some subgraphs
• Decomposing planar graphs into graphs with degree restrictions
• A note on Alon-Tarsi number of Halin graphs
• The Alon-Tarsi number of planar graphs without some forbidden configurations
• On the Alon-Tarsi number of semi-strong product of graphs
• A \((3,1)^\ast\)-choosable theorem on planar graphs
• The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
• 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
• Colouring planar graphs with bounded monochromatic components
• Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions
• 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
• Sparse critical graphs for defective (1, 3)-coloring
• 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)