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
Planar graphs without cycles of specific lengths
European Journal of Combinatorics
ASIAN '02 Proceedings of the7th Asian Computing Science Conference on Advances in Computing Science: Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster
List Improper Colourings of Planar Graphs
Combinatorics, Probability and Computing
A map colour theorem for the union of graphs
Journal of Combinatorial Theory Series B
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The 4-choosability of toroidal graphs without intersecting triangles
Information Processing Letters
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
A sufficient condition for a planar graph to be 3-choosable
Information Processing Letters
A note on 3-choosability of planar graphs
Information Processing Letters
On 3-choosability of planar graphs without certain cycles
Information Processing Letters
A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable
Information Processing Letters
Locally planar graphs are 5-choosable
Journal of Combinatorial Theory Series B
2-List-coloring planar graphs without monochromatic triangles
Journal of Combinatorial Theory Series B
The chromatic polynomial and list colorings
Journal of Combinatorial Theory Series B
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
List-coloring graphs without K4,k-minors
Discrete Applied Mathematics
Planar graphs are 1-relaxed, 4-choosable
European Journal of Combinatorics
Information Processing Letters
Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
Discrete Applied Mathematics
Asymptotic enumeration and limit laws for graphs of fixed genus
Journal of Combinatorial Theory Series A
Local 7-coloring for planar subgraphs of unit disk graphs
Theoretical Computer Science
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
SIAM Journal on Discrete Mathematics
Thomassen's Choosability Argument Revisited
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
Acyclic choosability of graphs with small maximum degree
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
From the plane to higher surfaces
Journal of Combinatorial Theory Series B
Graphs with Two Crossings Are 5-Choosable
SIAM Journal on Discrete Mathematics
3-choosability of planar graphs with (≤4)-cycles far apart
Journal of Combinatorial Theory Series B
Precoloring extension involving pairs of vertices of small distance
Discrete Applied Mathematics
Hi-index | 0.05 |