The following pages link to Every planar graph is 5-choosable (Q1333334):
Displaying 8 items.
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- The number of \(k\)-colorings of a graph on a fixed surface (Q856865) (← links)
- Exponentially many 5-list-colorings of planar graphs (Q885292) (← links)
- Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008) (← links)
- On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs (Q1751381) (← links)
- Decomposing a planar graph into an independent set and a 3-degenerate graph (Q1850567) (← links)
- Facial unique-maximum colorings of plane graphs with restriction on big vertices (Q2312801) (← links)
- Extending partial 5-colorings and 6-colorings in planar graphs (Q2581502) (← links)
