Hamiltonian cycles and dominating cycles passing through a linear forest

DOI10.1016/j.disc.2008.02.031zbMath1198.05108OpenAlexW2065854866MaRDI QIDQ1024474

Tomoki Yamashita, Kenta Ozeki

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.031

zbMATH Keywords

connectivityHamiltonian cycledegree sumlinear forestdominating cycle

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• A look at cycles containing specified elements of a graph
• A generalization of a result of Häggkvist and Nicoghossian
• Circuits through specified edges
• Advances on the Hamiltonian problem -- a survey
• Note on Hamilton Circuits
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• Generalization of a Theorem of Posa

This page was built for publication: Hamiltonian cycles and dominating cycles passing through a linear forest