Nash Williams Conjecture and the Dominating Cycle Conjecture
Combinatorics
2015-08-12 v3
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.
Cite
@article{arxiv.1305.3951,
title = {Nash Williams Conjecture and the Dominating Cycle Conjecture},
author = {Arthur Hoffmann-Ostenhof},
journal= {arXiv preprint arXiv:1305.3951},
year = {2015}
}