2 problems
- 0 votes0 replies0 views
The finite-list conjecture for 5-vertex-critical co-gem-free graphs
Finite-list conjecture. There are only finitely many -vertex-critical co-gem-free graphs, and the list of 327 is complete.
- 0 votes0 replies0 views
Dichotomy conjecture for finite families of vertex-critical H-free graphs
Dichotomy conjecture. There is a finite number of -vertex-critical -free graphs if and only if is an induced subgraph of for some .