Disjoint Hamilton cycles in the star graph

DOI10.1016/j.ipl.2009.10.001zbMath1209.68011OpenAlexW2054361179MaRDI QIDQ990094

Roman Čada, Moshe Rosenfeld, Tomáš Kaiser, Zdeněk Ryjáček

Publication date: 2 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.10.001

zbMATH Keywords

interconnection networkHamilton cycleGray codestar graphbuble-sort graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Disjoint Hamilton cycles in transposition graphs ⋮ On the construction of all shortest node-disjoint paths in star networks ⋮ Worst-case efficient dominating sets in digraphs ⋮ Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs ⋮ Structural properties of subdivided-line graphs ⋮ Star graph automorphisms and disjoint Hamilton cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjoint Hamiltonian cycles in recursive circulant graphs
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Doubly adjacent gray codes for the symmetric group
• A Survey of Combinatorial Gray Codes
• The locally twisted cubes
• Hamiltonian-laceability of star graphs
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• Generation of Permutations by Adjacent Transposition

This page was built for publication: Disjoint Hamilton cycles in the star graph