3 problems
Jia–Fan–Liu's conjecture. If
Completeness conjecture. If is a minimal --factor-critical graph, then is a complete graph.
Favaron–Shi's conjecture. If is a minimal -factor-critical graph, then
Jia–Fan–Liu's conjecture. If
Completeness conjecture. If is a minimal --factor-critical graph, then is a complete graph.
Favaron–Shi's conjecture. If is a minimal -factor-critical graph, then