The following pages link to List colourings of planar graphs (Q687126):
Displaying 50 items.
- A new sufficient condition for a toroidal graph to be 4-choosable (Q1660275) (← links)
- A sufficient condition for planar graphs to be (3,1)-choosable (Q1679498) (← links)
- On list \(r\)-hued coloring of planar graphs (Q1680495) (← links)
- Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two (Q1682205) (← links)
- Dynamic coloring parameters for graphs with given genus (Q1682887) (← links)
- Choosability with union separation (Q1690218) (← links)
- Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
- Defective 3-paintability of planar graphs (Q1753126) (← links)
- Smaller planar triangle-free graphs that are not 3-list-colorable (Q1772422) (← links)
- The 3-choosability of plane graphs of girth 4 (Q1781982) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- A not 3-choosable planar graph without 3-cycles (Q1903746) (← links)
- Choosability of planar graphs (Q1916256) (← links)
- Coloring Eulerian triangulations of the Klein bottle (Q1926035) (← links)
- The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
- Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable (Q1988544) (← links)
- On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744) (← links)
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring (Q2000575) (← links)
- Choosability with union separation of triangle-free planar graphs (Q2005734) (← links)
- Acyclic improper choosability of subcubic graphs (Q2009524) (← links)
- Differences between the list-coloring and DP-coloring for planar graphs (Q2032896) (← links)
- Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles (Q2042281) (← links)
- An analogue of DP-coloring for variable degeneracy and its applications (Q2062675) (← links)
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable (Q2062893) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
- On list \(r\)-hued coloring of outer-1-planar graphs (Q2101936) (← links)
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces (Q2121742) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← links)
- A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
- The Alon-Tarsi number of a planar graph minus a matching (Q2200936) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs (Q2259863) (← links)
- A refinement of choosability of graphs (Q2284741) (← links)
- Choosability with separation of planar graphs without prescribed cycles (Q2284787) (← links)
- List coloring and diagonal coloring for plane graphs of diameter two (Q2286099) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Locally planar graphs are 5-paintable (Q2346337) (← links)
- On choosability with separation of planar graphs with lists of different sizes (Q2346342) (← links)
- List \((p,q)\)-coloring of sparse plane graphs (Q2371265) (← links)
- A sufficient condition for a planar graph to be 3-choosable (Q2380013) (← links)
- A note on 3-choosability of planar graphs (Q2380076) (← links)
- Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
- On \(t\)-common list-colorings (Q2401414) (← links)
