Hamiltonicity in k-tree-Halin graphs

DOI10.1007/978-3-319-28186-5_5MaRDI QIDQ5354934zbMATH OpenOpenAlexFDO

Authors Ayesha Shabbir, Tudor Zamfirescu

Publication date 6 September 2017

Published in Convexity and Discrete Geometry Including Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28186-5_5

zbMATH Keywords

\(k\)-tree-Halin graphHalin graphHamiltoniantraceable

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Hamiltonian Properties of Generalized Halin Graphs
• Hamiltonicity of cubic 3-connected \(k\)-Halin graphs
• scientific article; zbMATH DE number 4059449
• scientific article; zbMATH DE number 434484
• On the chromatic number of Halin graphs

Cited in

(9)

• Hamiltonicity of cubic 3-connected \(k\)-Halin graphs
• Hamiltonian Properties of Generalized Halin Graphs
• Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
• scientific article; zbMATH DE number 4181359 (Why is no real title available?)
• scientific article; zbMATH DE number 3867372 (Why is no real title available?)
• scientific article; zbMATH DE number 2104719 (Why is no real title available?)
• Construction of Halin graph with perfect k-ary tree and its independent domination number
• Hamiltonicity of tree-like graphs
• The rotation graph of \(k\)-ary trees is Hamiltonian

This page was built for publication: Hamiltonicity in \(k\)-tree-Halin graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5354934)