Disjoint cycles in hypercubes with prescribed vertices in each cycle

DOI10.1016/J.DAM.2013.07.004MaRDI QIDQ2446892zbMATH OpenOpenAlexFDO

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

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

cyclableHamiltonian cyclehypercubespanning cycle

Mathematics Subject Classification ID

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

Recommendations

• Disjoint cycles and spanning graphs of hypercubes
• Vertex‐disjoint cycles containing prescribed vertices
• Disjoint cycles through prescribed vertices in multidimensional tori
• A Note on Vertex-Disjoint Cycles
• Disjoint cycles with prescribed lengths and independent edges in graphs
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Edge-disjoint Hamiltonian cycles of balanced hypercubes
• scientific article; zbMATH DE number 1416474
• Vertex-disjoint cycles of prescribed length on tournaments
• Vertex disjoint non-separating cycles in graphs

Cites work

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

Cited in

(12)

• Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
• The spanning cyclability of Cayley graphs generated by transposition trees
• On the cyclability of graphs
• A note on the spanning cyclability of graphs
• Vertex‐disjoint cycles containing prescribed vertices
• Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges
• Disjoint cycles through prescribed vertices in multidimensional tori
• Fault-tolerant cycles embedding in hypercubes with faulty edges
• The disjoint path cover in the data center network HSDC with prescribed vertices in each path
• Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube
• On the 2-spanning cyclability of honeycomb toroidal graphs
• Disjoint cycles and spanning graphs of hypercubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446892)