Hamiltonian cycles and dominating cycles passing through a linear forest

DOI10.1016/J.DISC.2008.02.031zbMATH Open1198.05108OpenAlexW2065854866MaRDI QIDQ1024474FDOQ1024474

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

Recommendations

• Long cycles through a linear forest
• scientific article
• Long cycles passing through a linear forest
• A degree sum condition for long cycles passing through a linear forest
• Degree sum and connectivity conditions for dominating cycles

zbMATH Keywords

Hamiltonian cycleconnectivitydegree 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

• Note on Hamilton Circuits
• Title not available (Why is that?)
• A look at cycles containing specified elements of a graph
• A generalization of a result of Häggkvist and Nicoghossian
• Advances on the Hamiltonian problem -- a survey
• Title not available (Why is that?)
• Circuits through specified edges
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• Generalization of a Theorem of Posa

Cited In (5)

• Ciclos hamiltonianos que pasan a través de un bosque lineal en grafos bipartitos balanceados
• Long cycles through a linear forest
• On a cycle through a specified linear forest of a graph
• Hamilton paths in dominating graphs of trees and cycles
• Title not available (Why is that?)

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

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