Planar graphs are 1-relaxed, 4-choosable
From MaRDI portal
Publication:976159
DOI10.1016/j.ejc.2009.11.013zbMath1221.05077OpenAlexW2093490044MaRDI QIDQ976159
William Cushing, Henry 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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (29)
\((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Every planar graph is 1-defective \((9,2)\)-paintable ⋮ Improper Choosability and Property B ⋮ Colouring planar graphs with bounded monochromatic components ⋮ Decomposing planar graphs into graphs with degree restrictions ⋮ A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles ⋮ The Alon–Tarsi number of planar graphs revisited ⋮ Decomposition of toroidal graphs without some subgraphs ⋮ A note on relaxed equitable coloring of graphs ⋮ On the Alon-Tarsi number of semi-strong product of graphs ⋮ Weak (2, 3)-decomposition of planar graphs ⋮ Sparse critical graphs for defective DP-colorings ⋮ The Alon-Tarsi number of a planar graph minus a matching ⋮ Decomposition of planar graphs with forbidden configurations ⋮ On 2-defective DP-colorings of sparse graphs ⋮ Defective DP-colorings of sparse multigraphs ⋮ On generalized choice and coloring numbers ⋮ Defective DP-colorings of sparse simple graphs ⋮ Defective 3-paintability of planar graphs ⋮ Acyclic improper choosability of subcubic graphs ⋮ Islands in Graphs on Surfaces ⋮ Locally planar graphs are 2-defective 4-paintable ⋮ On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles ⋮ Relaxed equitable colorings of planar graphs with girth at least 8 ⋮ The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\) ⋮ Defective and clustered choosability of sparse graphs ⋮ Equitable defective coloring of sparse planar graphs ⋮ The Alon-Tarsi number of \(K_5\)-minor-free graphs
Cites Work
This page was built for publication: Planar graphs are 1-relaxed, 4-choosable
