Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
From MaRDI portal
Publication:394540
DOI10.1016/j.disc.2013.12.014zbMath1281.05100arXiv1301.2931OpenAlexW2129394762MaRDI QIDQ394540
Publication date: 27 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.2931
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
Extending perfect matchings to Gray codes with prescribed ends ⋮ Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On ring embedding in hypercubes with faulty nodes and links
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Matching graphs of hypercubes and complete bipartite graphs
- A survey of the theory of hypercube graphs
- Perfect matchings extend to Hamilton cycles in hypercubes
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- On Hamiltonian circuits and spanning trees of hypercubes
- Hamiltonian fault-tolerance of hypercubes
- Matching Extendability in Hypercubes
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- A Survey of Combinatorial Gray Codes
- 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: Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
