The Nash-Williams Conjecture and the Dominating Cycle Conjecture

  • Arthur Hoffmann-Ostenhof
DOI: https://doi.org/10.37236/5505

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
Issue
Volume 27, Issue 1 (2020)
Article Number
P1.46