Matchings extend to Hamiltonian cycles in k-ary n-cubes
From MaRDI portal
(Redirected from Publication:528780)
Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
Recommendations
- Hamiltonian cycles through prescribed edges in k-ary n-cubes
- A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
- Hamiltonian cycles passing through linear forests in k-ary n-cubes
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
Cited in
(14)- Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
- A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
- RVCCC: a new variational network of cube-connected cycles and its topological properties
- Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes
- Perfect matchings extend to Hamilton cycles in hypercubes
- Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
- Hamiltonian cycles through prescribed edges in k-ary n-cubes
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- Clique matchings in the \(k\)-ary \(n\)-dimensional cube
- Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even
- Hamiltonian cycles passing through linear forests in k-ary n-cubes
- Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube
This page was built for publication: Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528780)
