Gro¨tzsch's 3-color theorem and its counterparts for the torus and the projective plane

Superposition and constructions of graphs without nowhere-zero k-flows

European Journal of Combinatorics

The chromatic number of a graph of girth 5 on a fixed surface

Journal of Combinatorial Theory Series B

A short list color proof of Grötzsch's theorem

Journal of Combinatorial Theory Series B

Three-coloring Klein bottle graphs of girth five

Journal of Combinatorial Theory Series B

Homomorphism bounded classes of graphs

European Journal of Combinatorics

Folding

Journal of Combinatorial Theory Series B

Many 3-colorings of triangle-free planar graphs

Journal of Combinatorial Theory Series B

Nowhere-zero 3-flows in triangularly connected graphs

Journal of Combinatorial Theory Series B

Coloring triangle-free graphs on surfaces

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

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

A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 3 - Volume 3

Three-coloring triangle-free planar graphs in linear time

ACM Transactions on Algorithms (TALG)

Survey: Colouring, constraint satisfaction, and complexity

Computer Science Review

Nowhere-zero 3-flows and modulo k-orientations

Journal of Combinatorial Theory Series B

Sub-exponentially many 3-colorings of triangle-free planar graphs

Journal of Combinatorial Theory Series B

Short proofs of coloring theorems on planar graphs

European Journal of Combinatorics