The following pages link to List colourings of planar graphs (Q687126):
Displaying 50 items.
- A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
- 5-list-coloring planar graphs with distant precolored vertices (Q345086) (← links)
- Multiple list colouring of planar graphs (Q345127) (← links)
- From the plane to higher surfaces (Q444375) (← links)
- 5-choosability of graphs with crossings far apart (Q505910) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- A sufficient condition for a planar graph to be 4-choosable (Q526822) (← links)
- List precoloring extension in planar graphs (Q536235) (← links)
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) (← links)
- Some structural properties of planar graphs and their applications to 3-choosability (Q658061) (← links)
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
- Planar graphs without cycles of specific lengths (Q697075) (← links)
- Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
- What is on his mind? (Q709300) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
- On choosability with separation of planar graphs without adjacent short cycles (Q723623) (← links)
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863) (← links)
- On the choice number of complete multipartite graphs with part size four (Q739044) (← links)
- Graph polynomials and paintability of plane graphs (Q833000) (← links)
- The 4-choosability of toroidal graphs without intersecting triangles (Q845970) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- A small non-\(\mathbb Z_4\)-colorable planar graph (Q879348) (← links)
- Distance constraints in graph color extensions (Q885289) (← links)
- Exponentially many 5-list-colorings of planar graphs (Q885292) (← links)
- Choosability in signed planar graphs (Q896077) (← links)
- Locally planar graphs are 5-choosable (Q958683) (← links)
- 2-list-coloring planar graphs without monochromatic triangles (Q958693) (← links)
- On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410) (← links)
- Planar graphs are 1-relaxed, 4-choosable (Q976159) (← links)
- The chromatic polynomial and list colorings (Q1003851) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- The complexity of planar graph choosability (Q1126188) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- You can't paint yourself into a corner (Q1272489) (← links)
- The list chromatic numbers of some planar graphs (Q1288297) (← links)
- The 4-choosability of plane graphs without 4-cycles (Q1305526) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- Color-critical graphs on a fixed surface (Q1369650) (← links)
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles (Q1430647) (← links)
- DP-3-coloring of some planar graphs (Q1618234) (← links)
- A note on not-4-list colorable planar graphs (Q1640221) (← links)
- Choice numbers of multi-bridge graphs (Q1650388) (← links)
- 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)
- Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two (Q1682205) (← links)
