The Nash-Williams Conjecture and the Dominating Cycle Conjecture
Abstract
The disproved Nash-Williams conjecture states that every 4-regular 4-connected graph has a hamiltonian cycle. We show that a modification of this conjecture is equivalent to the Dominating Cycle Conjecture.
Published
2020-02-21
How to Cite
Hoffmann-Ostenhof, A. (2020). The Nash-Williams Conjecture and the Dominating Cycle Conjecture. The Electronic Journal of Combinatorics, 27(1), P1.46. https://doi.org/10.37236/5505
Article Number
P1.46