A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
From MaRDI portal
Publication:1637214
DOI10.1016/j.tcs.2018.03.029zbMath1394.68269OpenAlexW2796100888WikidataQ130027136 ScholiaQ130027136MaRDI QIDQ1637214
Publication date: 7 June 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.03.029
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
- Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
- Matching graphs of hypercubes and complete bipartite graphs
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
- Hamiltonian paths with prescribed edges in hypercubes
- Spanning multi-paths in hypercubes
- Perfect matchings extend to Hamilton cycles in hypercubes
- Panconnectivity and edge-pancyclicity ofk-aryn-cubes
- Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
- Lee distance and topological properties of k-ary n-cubes
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
This page was built for publication: A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
