Enforced Hamiltonian cycles in circulant graphs
From MaRDI portal
(Redirected from Publication:5374240)
Recommendations
Cites work
- \(H\)-force sets of locally semicomplete digraphs
- A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
- A note on Hamiltonian circuits
- Circulants and their connectivities
- Efficiently solvable special cases of bottleneck travelling salesman problems
- Enforced Hamiltonian cycles in generalized dodecahedra
- Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs
- scientific article; zbMATH DE number 1002024 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- n-Hamiltonian graphs
- On planarity and colorability of circulant graphs
- On the H-force number of Hamiltonian graphs and cycle extendability
- On vertices enforcing a Hamiltonian cycle
- The \(H\)-force set of a hypertournament
Cited in
(7)- The H-force sets of the graphs satisfying the condition of Ore's theorem
- The \(H\)-force set of a hypertournament
- On vertices enforcing a Hamiltonian cycle
- On the H-force number of Hamiltonian graphs and cycle extendability
- Enforced Hamiltonian cycles in generalized dodecahedra
- scientific article; zbMATH DE number 5175631 (Why is no real title available?)
- \(H\)-force sets of locally semicomplete digraphs
This page was built for publication: Enforced Hamiltonian cycles in circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5374240)
