Three-colourbility and forbidden subgraphs. II: polynomial algorithms
Discrete Mathematics
On the quasi-locally paw-free graphs
Discrete Mathematics - Special issue: The 18th British combinatorial conference
3-Colorability ∈ P for P6-free graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
3-Coloring and 3-clique-ordering of locally connected graphs
Journal of Algorithms
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
Discrete Applied Mathematics
Three complexity results on coloring Pk-free graphs
European Journal of Combinatorics
Hi-index | 0.00 |