Hamiltonian cycles through prescribed edges in k-ary n-cubes
From MaRDI portal
Publication:5199142
Recommendations
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
- Hamiltonian cycles passing through linear forests in k-ary n-cubes
Cited in
(14)- A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
- Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
- Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
- Mutually independent Hamiltonian cycles in \(k\)-ary \(n\)-cubes when \(k\) is even
- Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
- Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
- Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
- A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube
This page was built for publication: Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199142)
