Colouring Eulerian triangulations
Journal of Combinatorial Theory Series B
Coloring locally bipartite graphs on surfaces
Journal of Combinatorial Theory Series B
The circular chromatic number of series-parallel graphs of large odd girth
Discrete Mathematics
Coloring Eulerian triangulations of the projective plane
Discrete Mathematics - Algebraic and topological methods in graph theory
Quadrangulations and 4-color-critical graphs
Journal of Combinatorial Theory Series B
Three-coloring Klein bottle graphs of girth five
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
Graphs with bounded tree-width and large odd-girth are almost bipartite
Journal of Combinatorial Theory Series B
Short proofs of coloring theorems on planar graphs
European Journal of Combinatorics
Hi-index | 0.00 |