Nash Williams Conjecture and the Dominating Cycle Conjecture
classification
🧮 math.CO
keywords
conjecturecycledominatingnashwilliamsconnecteddisprovedequivalent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.