Show
Sort by
-
- Journal Article
- A1
- open access
Some results on k-critical P5-free graphs
-
- Journal Article
- A1
- open access
Better 3-coloring algorithms : excluding a triangle and a seven vertex path
-
- Journal Article
- A1
- open access
k-Critical graphs in P5-free graphs
-
Obstructions for three-coloring graphs without induced paths on six vertices
-
- Journal Article
- A1
- open access
Obstructions for three-coloring and list three-coloring H-free graphs
-
Exhaustive generation of k-critical H-free graphs
-
Exhaustive generation of k-critical H-free graphs