z-logo
open-access-imgOpen Access
A note on Hamiltonian cycles in generalized Halin graphs
Author(s) -
Magdalena Bojarska
Publication year - 2010
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1524
Subject(s) - mathematics , combinatorics , hamiltonian path , discrete mathematics , graph
We show that every 2-connected (2)-Halin graph is Hamiltonian.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom