A note on Hamiltonian cycles in generalized Halin graphs
Magdalena Bojarska
Discussiones Mathematicae Graph Theory, Tome 30 (2010), p. 701-704 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

We show that every 2-connected (2)-Halin graph is Hamiltonian.

Publié le : 2010-01-01
EUDML-ID : urn:eudml:doc:270866 
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1524,
     author = {Magdalena Bojarska},
     title = {A note on Hamiltonian cycles in generalized Halin graphs},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {30},
     year = {2010},
     pages = {701-704},
     zbl = {1217.05068},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1524}
}

Magdalena Bojarska. A note on Hamiltonian cycles in generalized Halin graphs. Discussiones Mathematicae Graph Theory, Tome 30 (2010) pp. 701-704. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1524/

[000] [1] C.A. Barefoot, Hamiltonian connectivity of the Halin graphs, in: Eighteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, Fla., 1987), Congr. Numer. 58 (1987) 93-102. | Zbl 0649.05047

[001] [2] J.A. Bondy and L. Lovasz Lengths of cycles in Halin graphs, J. Graph Theory 9 (1985) 397-410, doi: 10.1002/jgt.3190090311. | Zbl 0587.05039