Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of S_n

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

Hamiltonian cycles in n‐extendable graphs
Hamilton cycles in some vertex-transitive graphs
Hyper hamiltonian laceability of Cayley graphs generated by transpositions
Matchings extend to Hamiltonian cycles in $k$-ary $n$-cubes
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
Hamiltonian cycles in normal Cayley graphs
A survey: Hamiltonian cycles in Cayley graphs
A survey: Hamiltonian cycles in Cayley graphs
The edge transitivity and Hamiltonian property of a class of Cayley graphs
scientific article; zbMATH DE number 1488865

Cited in

(39)

Matching graphs of hypercubes and complete bipartite graphs
Hamilton-connected derangement graphs on $S_ n$
The Hamiltonicity of directed $\sigma$-$\tau$ Cayley graphs (Or: A tale of backtracking)
Ranking and unranking permutations in linear time
Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
A type of perfect matchings extend to Hamiltonian cycles in $k$-ary $n$-cubes
Extending perfect matchings to Gray codes with prescribed ends
Towards a problem of Ruskey and Savage on matching extendability
Matchings extend to Hamiltonian cycles in 5-cube
Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
Perfect matchings and Hamiltonicity in the Cartesian product of cycles
Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
Extending perfect matchings to Hamiltonian cycles in line graphs
The SAT+CAS method for combinatorial search with applications to best matrices
Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
Small cycles, generalized prisms and Hamiltonian cycles in the bubble-sort graph
On the central levels problem
Hyper hamiltonian laceability of Cayley graphs generated by transpositions
MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers
scientific article; zbMATH DE number 4106894 (Why is no real title available?)
Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
Extensions to 2-factors in bipartite graphs
Hamiltonian cycles in unitary prefix transposition rearrangement graphs
On a combinatorial generation problem of Knuth
Rainbow cycles in flip graphs
Rainbow cycles in flip graphs
Small matchings extend to Hamiltonian cycles in hypercubes
Star transposition Gray codes for multiset permutations
A kind of matchings extend to Hamiltonian cycles in hypercubes
Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
On the central levels problem
Generating all invertible matrices by row operations
Matchings in hypercubes extend to long cycles
Cycle partitions in dense regular digraphs and oriented graphs
Cycle partition of dense regular digraphs and oriented graphs (extended abstract)
Matchings in hypercubes extend to long cycles
Generating all invertible matrices by row operations
Matchings with five directions in hypercubes extend to Hamilton cycles and paths with prescribed ends
Disjoint Hamilton cycles in the star graph

This page was built for publication: Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $

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