Counterexample to a conjecture on Hamilt
โ
P Paulraja
๐
Article
๐
1987
๐
Elsevier Science
๐
English
โ 65 KB
We disprove the following conjecture: Let G be a 2-connected graph with minimum degree n on atmost 3n -2 vertices. Then G is hamiltonian if it has a 2-factor.