Geodesic
On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs
Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 2, pp. 207-214

Voir la notice de l'article provenant de la source Library of Science

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 and arbitrary maximum degree. Finally, we show that a construction due to Entringer and Swart can be modified to construct triangle-free uniquely Hamiltonian graphs with minimum degree 3.
Keywords: Hamiltonian cycle, uniquely Hamiltonian graphs, claw-free graphs, triangle-free graphs 
@article{DMGT_2015_35_2_a0,
     author = {Seamone, Ben},
     title = {On {Uniquely} {Hamiltonian} {Claw-Free} and {Triangle-Free} {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {207--214},
     publisher = {mathdoc},
     volume = {35},
     number = {2},
     year = {2015},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2015_35_2_a0/}
}
TY  - JOUR
AU  - Seamone, Ben
TI  - On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2015
SP  - 207
EP  - 214
VL  - 35
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2015_35_2_a0/
LA  - en
ID  - DMGT_2015_35_2_a0
ER  - 
%0 Journal Article
%A Seamone, Ben
%T On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2015
%P 207-214
%V 35
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2015_35_2_a0/
%G en
%F DMGT_2015_35_2_a0
Seamone, Ben. On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs. Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 2, pp. 207-214. http://geodesic.mathdoc.fr/item/DMGT_2015_35_2_a0/