Lovász Hamiltonian path conjecture
Does complete symmetry among a connected graph’s vertices guarantee a route visiting every vertex exactly once?
Graph theory
Within Graph theory · Search all subjects
Chvátal’s toughness conjecture
Is there one fixed level of resistance to vertex removal that guarantees a round trip visiting every vertex exactly once?