Counterexample to a conjecture on Hamilton cycles (Q1086587)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3985269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counterexample to a conjecture on Hamilton cycles |
scientific article; zbMATH DE number 3985269 |
Statements
Counterexample to a conjecture on Hamilton cycles (English)
0 references
1987
0 references
We disprove the following conjecture [cf. ''Unsolved problems'', Cycles in graphs, Workshop Simon Fraser Univ., Burnaby/Can. 1982, Ann. Discrete Math. 27, 461-468 (1985)]: 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.
0 references
Hamiltonian
0 references
2-factor
0 references
0.8959435
0 references
0.89346695
0 references
0.8925692
0 references
0.8905587
0 references
0 references
0.88925534
0 references
0.8875134
0 references
0.88420993
0 references
