The following pages link to Every planar graph is 5-choosable (Q1333334):
Displaying 50 items.
- Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk. (Q273167) (← links)
- 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)
- Coloring planar homothets and three-dimensional hypergraphs (Q364847) (← links)
- Homomorphism bounds for oriented planar graphs of given minimum girth (Q367080) (← links)
- From the plane to higher surfaces (Q444375) (← links)
- Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
- Maximum 4-degenerate subgraph of a planar graph (Q490312) (← links)
- 5-choosability of graphs with crossings far apart (Q505910) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- List coloring of planar graphs with forbidden cycles (Q510959) (← links)
- Degree choosable signed graphs (Q512558) (← links)
- On-line list coloring of matroids (Q516838) (← links)
- A sufficient condition for a planar graph to be 4-choosable (Q526822) (← links)
- List precoloring extension in planar graphs (Q536235) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← 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)
- A note on the acyclic 3-choosability of some planar graphs (Q708344) (← 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)
- Contractibility and the Hadwiger conjecture (Q710728) (← links)
- Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
- Five-coloring graphs on the Klein bottle (Q713974) (← 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)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- Graph polynomials and paintability of plane graphs (Q833000) (← links)
- The 4-choosability of toroidal graphs without intersecting triangles (Q845970) (← links)
- The number of \(k\)-colorings of a graph on a fixed surface (Q856865) (← links)
- Many 3-colorings of triangle-free planar graphs (Q875936) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- A small non-\(\mathbb Z_4\)-colorable planar graph (Q879348) (← links)
- Exponentially many 5-list-colorings of planar graphs (Q885292) (← links)
- Choosability in signed planar graphs (Q896077) (← links)
- Another proof of the 5-choosability of \(K_5\)-minor-free graphs (Q932663) (← 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)
- Planar graphs are 1-relaxed, 4-choosable (Q976159) (← links)
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957) (← links)
- The chromatic polynomial and list colorings (Q1003851) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008) (← links)
- List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
