A note on planar 5-list colouring: non-extendability at distance 4
Discrete Mathematics
Coloring face-hypergraphs of graphs on surfaces
Journal of Combinatorial Theory Series B
Long cycles in graphs on a fixed surface
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
Three-coloring Klein bottle graphs of girth five
Journal of Combinatorial Theory Series B
A theorem on paths in locally planar triangulations
European Journal of Combinatorics - Special issue: Topological graph theory
Extending precolorings of subgraphs of locally planar graphs
European Journal of Combinatorics - Special issue: Topological graph theory
Some remarks on Hajós' conjecture
Journal of Combinatorial Theory Series B
Many 3-colorings of triangle-free planar graphs
Journal of Combinatorial Theory Series B
Distance constraints in graph color extensions
Journal of Combinatorial Theory Series B
Exponentially many 5-list-colorings of planar graphs
Journal of Combinatorial Theory Series B
Locally planar graphs are 5-choosable
Journal of Combinatorial Theory Series B
Linear connectivity forces large complete bipartite minors
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
List-color-critical graphs on a fixed surface
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Additive approximation algorithms for list-coloring minor-closed class of graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Coloring triangle-free graphs on surfaces
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Star Coloring and Acyclic Coloring of Locally Planar Graphs
SIAM Journal on Discrete Mathematics
Finite dualities and map-critical graphs on a fixed surface
Journal of Combinatorial Theory Series B
Gallai's Theorem for List Coloring of Digraphs
SIAM Journal on Discrete Mathematics
5-Coloring Graphs with 4 Crossings
SIAM Journal on Discrete Mathematics
List-coloring graphs without subdivisions and without immersions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Five-coloring graphs on the Klein bottle
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |