The NP-completeness of (1,r)-subcolorability of cubic graphs
Information Processing Letters
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Graph Subcolorings: Complexity and Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Computing
A hypocoloring model for batch scheduling
Discrete Applied Mathematics
Graph Theory, Computational Intelligence and Thought
A hypocoloring model for batch scheduling
Discrete Applied Mathematics
On 2-subcolourings of chordal graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the readability of monotone Boolean formulae
Journal of Combinatorial Optimization
The hypocoloring problem: complexity and approximability results when the chromatic number is small
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Minimum partition of an independence system into independent sets
Discrete Optimization
A survey of Nordhaus-Gaddum type relations
Discrete Applied Mathematics
| Hi-index | 0.00 |