Disjoint Hamilton cycles in the star graph
From MaRDI portal
Publication:990094
DOI10.1016/J.IPL.2009.10.001zbMATH Open1209.68011OpenAlexW2054361179MaRDI QIDQ990094FDOQ990094
Authors: Roman Čada, Tomáš Kaiser, Moshe Rosenfeld, 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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- The locally twisted cubes
- Disjoint Hamiltonian cycles in recursive circulant graphs
- Title not available (Why is that?)
- A Survey of Combinatorial Gray Codes
- Generation of Permutations by Adjacent Transposition
- Hamiltonian-laceability of star graphs
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Doubly adjacent gray codes for the symmetric group
Cited In (9)
- King Arthur and his knights with two round tables
- Disjoint Hamilton cycles in transposition graphs
- Worst-case efficient dominating sets in digraphs
- Decomposition of star network \(S_5\) into Hamilton cycles
- On the construction of all shortest node-disjoint paths in star networks
- Optimal bounds for disjoint Hamilton cycles in star graphs
- Star graph automorphisms and disjoint Hamilton cycles
- Structural properties of subdivided-line graphs
- Mutually independent Hamiltonian connectivity of \((n,k)\)-star graphs
This page was built for publication: Disjoint Hamilton cycles in the star graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990094)
