Transposition Graphs
From MaRDI portal
Publication:5680157
DOI10.1137/0202011zbMath0264.05120OpenAlexW4242600561MaRDI QIDQ5680157
Publication date: 1973
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0202011
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Disjoint Hamilton cycles in transposition graphs ⋮ On realization graphs of degree sequences ⋮ On the benefits and risks of using fitness sharing for multimodal optimisation ⋮ Efficient computation of statistical procedures based on all subsets of a specified size ⋮ A method to solve conditional optimization problems with quadratic objective functions on the set of permutations ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs ⋮ Unnamed Item ⋮ Gray codes with restricted density
