Every planar graph is 5-choosable
Journal of Combinatorial Theory Series B
Gro¨tzsch's 3-color theorem and its counterparts for the torus and the projective plane
Journal of Combinatorial Theory Series B
3-list-coloring planar graphs of girth 5
Journal of Combinatorial Theory Series B
The chromatic number of a graph of girth 5 on a fixed surface
Journal of Combinatorial Theory Series B
Many 3-colorings of triangle-free planar graphs
Journal of Combinatorial Theory Series B
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
European Journal of Combinatorics
2-List-coloring planar graphs without monochromatic triangles
Journal of Combinatorial Theory Series B
Geometric spanners with small chromatic number
Computational Geometry: Theory and Applications
Three-coloring triangle-free planar graphs in linear time
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Decomposing a planar graph of girth 5 into an independent set and a forest
Journal of Combinatorial Theory Series B
Geometric spanners with small chromatic number
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Three-coloring triangle-free planar graphs in linear time
ACM Transactions on Algorithms (TALG)
5-Coloring Graphs with 4 Crossings
SIAM Journal on Discrete Mathematics
From the plane to higher surfaces
Journal of Combinatorial Theory Series B
Sub-exponentially many 3-colorings of triangle-free planar graphs
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |
We give a short proof of the result that every planar graph of girth 5 is 3-choosable and hence also of Grötzsch's theorem saying that every planar triangle-free graph is 3-colorable.