Hamiltonian cycles and dominating cycles passing through a linear forest
From MaRDI portal
(Redirected from Publication:1024474)
Recommendations
Cites work
- scientific article; zbMATH DE number 863469 (Why is no real title available?)
- scientific article; zbMATH DE number 3215865 (Why is no real title available?)
- A generalization of a result of Häggkvist and Nicoghossian
- A look at cycles containing specified elements of a graph
- Advances on the Hamiltonian problem -- a survey
- Circuits through specified edges
- Generalization of a Theorem of Posa
- Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
- Note on Hamilton Circuits
Cited in
(6)- scientific article; zbMATH DE number 2199618 (Why is no real title available?)
- 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
- A degree sum condition for long cycles passing through a linear forest
- Hamilton paths in dominating graphs of trees and cycles
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)