Every planar graph is 5-choosable
From MaRDI portal
Publication:1333334
Recommendations
Cited in
(only showing first 100 items - show all)- On 3-choosability of planar graphs without certain cycles
- A conjecture of Borodin and a coloring of Grünbaum
- On structure of some plane graphs with application to choosability
- A refinement of choosability of graphs
- An extension of Thomassen's result on choosability
- Choosability of toroidal graphs without short cycles
- Choosability of \(K_5\)-minor-free graphs
- The 3-choosability of plane graphs of girth 4
- Flexibility of triangle‐free planar graphs
- Facial unique-maximum colorings of plane graphs with restriction on big vertices
- Graph polynomials and paintability of plane graphs
- A note on not-4-list colorable planar graphs
- The asymptotic behavior of the correspondence chromatic number
- Choosability of P 5-Free Graphs
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
- Another proof of the 5-choosability of \(K_5\)-minor-free graphs
- On choosability with separation of planar graphs with forbidden cycles
- scientific article; zbMATH DE number 1383704 (Why is no real title available?)
- Coloring face-hypergraphs of graphs on surfaces
- A note on 3-choosability of plane graphs under distance restrictions
- List-coloring graphs without \(K_{4,k}\)-minors
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- Extending graph colorings
- Facially-constrained colorings of plane graphs: a survey
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces
- Group coloring is \(\Pi_2^{\text{P}}\)-complete
- Circular choosability
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
- Some Conjectures and Questions in Chromatic Topological Graph Theory
- A note on 3-choosability of planar graphs
- A sufficient condition for a planar graph to be 3-choosable
- Planar graphs without intersecting 5-cycles are 4-choosable
- The 4-choosability of planar graphs and cycle adjacency
- Algorithmic complexity of list colorings
- The Alon-Tarsi number of a planar graph minus a matching
- Contractibility and the Hadwiger conjecture
- The Alon-Tarsi number of planar graphs
- Planar graphs without normally adjacent short cycles
- A Conjecture of Borodin and a Coloring of Grünbaum
- On choosability with separation of planar graphs without adjacent short cycles
- Some structural properties of planar graphs and their applications to 3-choosability
- The 4-choosability of toroidal graphs without intersecting triangles
- Coloring of plane graphs with unique maximal colors on faces
- Note on 3-choosability of planar graphs with maximum degree 4
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles
- Local 7-coloring for planar subgraphs of unit disk graphs
- On-line DP-coloring of graphs
- Extension from precoloured sets of edges
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
- On 3-choosable planar graphs of girth at least 4
- A not 3-choosable planar graph without 3-cycles
- Facial list colourings of plane graphs
- A map colour theorem for the union of graphs
- The edge-face choosability of plane graphs
- Bordeaux 3-color conjecture and 3-choosability
- Locally planar graphs are 5-paintable
- The 4-choosability of plane graphs without 4-cycles
- Dynamic list coloring of 1-planar graphs
- A note on the acyclic 3-choosability of some planar graphs
- Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk.
- Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
- Five-coloring graphs on the Klein bottle
- Locally planar graphs are 5-choosable
- On the complexity of some colorful problems parameterized by treewidth
- Acyclic list 7‐coloring of planar graphs
- Adapted list coloring of planar graphs
- Multiple list colouring of planar graphs
- Acyclic 3-choosability of sparse graphs with girth at least 7
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
- On-line list coloring of matroids
- Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two
- Planar graphs without chordal 6-cycles are 4-choosable
- Planar graphs are 1-relaxed, 4-choosable
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable
- Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
- Dynamic coloring parameters for graphs with given genus
- Acyclic improper choosability of graphs
- List colourings of planar graphs
- 5-choosability of graphs with crossings far apart
- A small non-\(\mathbb Z_4\)-colorable planar graph
- On group choosability of graphs. II
- Coloring planar homothets and three-dimensional hypergraphs
- On the choice number of complete multipartite graphs with part size four
- Acyclic 5-choosability of planar graphs without adjacent short cycles
- Decomposing a planar graph of girth 5 into an independent set and a forest
- From the plane to higher surfaces
- Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
- Improper choosability and property B
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
- Dirac's map-color theorem for choosability
- Color-critical graphs on a fixed surface
- List-coloring graphs without subdivisions and without immersions
- Some recent progress and applications in graph minor theory
- You can't paint yourself into a corner
- Choosability in signed planar graphs
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
This page was built for publication: Every planar graph is 5-choosable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333334)
