Efficiently four-coloring planar graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Generalized map coloring for use in geographical information systems
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
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
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
List Improper Colourings of Planar Graphs
Combinatorics, Probability and Computing
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
Combinatorics, Probability and Computing
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
Combinatorics, Probability and Computing
The edge-face choosability of plane graphs
European Journal of Combinatorics
A map colour theorem for the union of graphs
Journal of Combinatorial Theory Series B
Extending partial 5-colorings and 6-colorings in planar graphs
Journal of Combinatorial Theory Series B
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Group coloring is Π2P-complete
Theoretical Computer Science - Graph colorings
List Set Colouring: Bounds and Algorithms
Combinatorics, Probability and Computing
The 4-choosability of toroidal graphs without intersecting triangles
Information Processing Letters
Many 3-colorings of triangle-free planar graphs
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
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
Hadwiger's conjecture is decidable
Proceedings of the forty-first annual ACM symposium on Theory of computing
Decomposing a planar graph of girth 5 into an independent set and a forest
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
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
Information Processing Letters
Low-complexity hierarchical spectrum sharing scheme in cognitive radio networks
IEEE Communications Letters
The reduced genus of a multigraph
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Note: A note on the acyclic 3-choosability of some planar graphs
Discrete Applied Mathematics
On the complexity of some colorful problems parameterized by treewidth
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Local 7-coloring for planar subgraphs of unit disk graphs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Planar graphs are 1-relaxed, 4-choosable
European Journal of Combinatorics
Contractibility and the Hadwiger Conjecture
European Journal of Combinatorics
Information Processing Letters
Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
Discrete Applied Mathematics
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
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
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Thomassen's Choosability Argument Revisited
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
Channel assignment and improper choosability of graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Acyclic choosability of graphs with small maximum degree
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
A Sufficient Condition for Planar Graphs
Journal of Graph Theory
From the plane to higher surfaces
Journal of Combinatorial Theory Series B
Graphs with Two Crossings Are 5-Choosable
SIAM Journal on Discrete Mathematics
List Colorings of K5-Minor-Free Graphs With Special List Assignments
Journal of Graph Theory
Five-coloring graphs on the Klein bottle
Journal of Combinatorial Theory Series B
Information Processing Letters
Planar graphs without 4- and 5-cycles are acyclically 4-choosable
Discrete Applied Mathematics
Note: Dynamic coloring and list dynamic coloring of planar graphs
Discrete Applied Mathematics
Coloring planar homothets and three-dimensional hypergraphs
Computational Geometry: Theory and Applications
3-choosability of planar graphs with (≤4)-cycles far apart
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |