Disjoint cycles in hypercubes with prescribed vertices in each cycle

DOI10.1016/j.dam.2013.07.004zbMath1287.05072OpenAlexW1971720796MaRDI QIDQ2446892

Jimmy J. M. Tan, Tzu-Liang Kung, Lih-Hsing Hsu, Cheng-Kuan Lin

Publication date: 23 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.07.004

zbMATH Keywords

hypercubeHamiltonian cyclecyclablespanning cycle

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle ⋮ The disjoint path cover in the data center network HSDC with prescribed vertices in each path ⋮ The spanning cyclability of Cayley graphs generated by transposition trees ⋮ Unnamed Item ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges

Cites Work

• Unnamed Item
• Unnamed Item
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Hamiltonian properties of locally connected graphs with bounded vertex degree
• Paley graphs have Hamilton decompositions
• Cycles through specified vertices
• Set-orderedness as a generalization of \(k\)-orderedness and cyclability
• The super laceability of the hypercubes
• Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
• Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
• The starlike trees which span a hypercube
• Hamiltonian decompositions of Cayley graphs on Abelian groups
• Cycles through subsets with large degree sums
• Hamiltonian decompositions of Cayley graphs on abelian groups of even order
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Cycles through prescribed vertices with large degree sum
• An efficient condition for a graph to be Hamiltonian
• On spanning connected graphs
• Pancyclic graphs. I
• On the number of cycles of lengthk in a maximal planar graph
• Cyclability of 3-connected graphs
• Algorithms and Computation

This page was built for publication: Disjoint cycles in hypercubes with prescribed vertices in each cycle