Relaxed game chromatic number of graphs
Discrete Mathematics
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
List Improper Colourings of Planar Graphs
Combinatorics, Probability and Computing
A simple competitive graph coloring algorithm II
Journal of Combinatorial Theory Series B
Deciding relaxed two-colourability: A hardness jump
Combinatorics, Probability and Computing
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
The t-improper chromatic number of random graphs
Combinatorics, Probability and Computing
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Graph coloring with cardinality constraints on the neighborhoods
Discrete Optimization
Journal of Discrete Algorithms
Computational Optimization and Applications
Hi-index | 0.00 |