List colourings of planar graphs
From MaRDI portal
Publication:687126
DOI10.1016/0012-365X(93)90579-IzbMath0790.05030OpenAlexW4212970601MaRDI QIDQ687126
Publication date: 22 June 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90579-i
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (only showing first 100 items - show all)
Algorithmic complexity of list colorings ⋮ The choice number versus the chromatic number for graphs embeddable on orientable surfaces ⋮ DP-3-coloring of some planar graphs ⋮ Graph polynomials and paintability of plane graphs ⋮ The 4-choosability of toroidal graphs without intersecting triangles ⋮ A sufficient condition for a planar graph to be 3-choosable ⋮ A note on 3-choosability of planar graphs ⋮ A note on not-4-list colorable planar graphs ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Choice numbers of multi-bridge graphs ⋮ A not 3-choosable planar graph without 3-cycles ⋮ 5-list-coloring planar graphs with distant precolored vertices ⋮ Multiple list colouring of planar graphs ⋮ Planar graphs without intersecting 5-cycles are 4-choosable ⋮ A new sufficient condition for a toroidal graph to be 4-choosable ⋮ Color-critical graphs on a fixed surface ⋮ On \(t\)-common list-colorings ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Choosability of planar graphs ⋮ Some recent progress and applications in graph minor theory ⋮ A small non-\(\mathbb Z_4\)-colorable planar graph ⋮ The complexity of planar graph choosability ⋮ \((4,2)\)-choosability of planar graphs with forbidden structures ⋮ List homomorphisms to reflexive graphs ⋮ Coloring Eulerian triangulations of the Klein bottle ⋮ A sufficient condition for planar graphs to be (3,1)-choosable ⋮ Colouring planar graphs with bounded monochromatic components ⋮ Distance constraints in graph color extensions ⋮ Exponentially many 5-list-colorings of planar graphs ⋮ Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two ⋮ Dynamic coloring parameters for graphs with given genus ⋮ Planar graphs without 7-cycles and butterflies are DP-4-colorable ⋮ Choosability with union separation ⋮ A generalization of some results on list coloring and DP-coloring ⋮ Choosability in signed planar graphs ⋮ Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable ⋮ Local 7-coloring for planar subgraphs of unit disk graphs ⋮ The Alon-Tarsi number of a planar graph minus a matching ⋮ Asymptotic enumeration and limit laws for graphs of fixed genus ⋮ 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart ⋮ From the plane to higher surfaces ⋮ Every toroidal graph is acyclically 8-choosable ⋮ On 3-choosability of plane graphs without 6-, 7- and 9-cycles ⋮ Some structural properties of planar graphs and their applications to 3-choosability ⋮ Concepts of signed graph coloring ⋮ The 4-choosability of planar graphs and cycle adjacency ⋮ 5-choosability of graphs with crossings far apart ⋮ An introduction to the discharging method via graph coloring ⋮ Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four ⋮ Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 ⋮ Planar graphs without chordal 6-cycles are 4-choosable ⋮ Defective 3-paintability of planar graphs ⋮ Locally planar graphs are 5-choosable ⋮ 2-list-coloring planar graphs without monochromatic triangles ⋮ A sufficient condition for a planar graph to be 4-choosable ⋮ On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) ⋮ Sufficient conditions on planar graphs to have a relaxed DP-3-coloring ⋮ On 3-choosability of planar graphs without certain cycles ⋮ List precoloring extension in planar graphs ⋮ Planar graphs without cycles of specific lengths ⋮ Choosability with union separation of triangle-free planar graphs ⋮ Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs ⋮ Acyclic improper choosability of subcubic graphs ⋮ A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable ⋮ Planar graphs are 1-relaxed, 4-choosable ⋮ Acyclic 3-choosability of sparse graphs with girth at least 7 ⋮ Smaller planar triangle-free graphs that are not 3-list-colorable ⋮ What is on his mind? ⋮ Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ The 3-choosability of plane graphs of girth 4 ⋮ On choosability with separation of planar graphs without adjacent short cycles ⋮ Differences between the list-coloring and DP-coloring for planar graphs ⋮ A refinement of choosability of graphs ⋮ Choosability with separation of planar graphs without prescribed cycles ⋮ List coloring and diagonal coloring for plane graphs of diameter two ⋮ The chromatic polynomial and list colorings ⋮ Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles ⋮ Planar graphs without 4-cycles adjacent to triangles are 4-choosable ⋮ On the choice number of complete multipartite graphs with part size four ⋮ DP-4-colorability of planar graphs without adjacent cycles of given length ⋮ You can't paint yourself into a corner ⋮ On 3-choosable planar graphs of girth at least 4 ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable ⋮ List-coloring graphs without \(K_{4,k}\)-minors ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ The list chromatic numbers of some planar graphs ⋮ Note on 3-choosability of planar graphs with maximum degree 4 ⋮ Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable ⋮ Planar graphs without 3-, 7-, and 8-cycles are 3-choosable ⋮ Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable ⋮ Choosability, edge choosability and total choosability of outerplane graphs ⋮ Distributed coloring in sparse graphs with fewer colors ⋮ Coloring face-hypergraphs of graphs on surfaces ⋮ The 4-choosability of plane graphs without 4-cycles ⋮ Connectivity and choosability of graphs with no \(K_t\) minor ⋮ Locally planar graphs are 5-paintable ⋮ On choosability with separation of planar graphs with lists of different sizes
Cites Work
This page was built for publication: List colourings of planar graphs
