On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs
A graph is uniquely Hamiltonian if it contains exactly one Hamiltonian cycle. In this note, we prove that claw-free graphs with minimum degree at least 3 are not uniquely Hamiltonian. We also show that this is best possible by exhibiting uniquely Hamiltonian claw-free graphs with minimum degree 2 an...
| Published in: | Discussiones Mathematicae Graph Theory |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2015-05-01
|
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1784 |