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 survey of Nordhaus-Gaddum type relations
Discrete Applied Mathematics
| Hi-index | 0.00 |