On the diameters of friends-and-strangers graphs

Cites Work

The minimum degree threshold for perfect graph packings
Title not available (Why is that?)
Shuffling Cards and Stopping Times
Generating a random permutation with random transpositions
A group-theoretic model for symmetric interconnection networks
Packings of graphs and applications to computational complexity
Elements of a theory of computer simulation. I
Packing random graphs and hypergraphs
Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
Mixing times of lozenge tiling and card shuffling Markov chains
Graph puzzles, homotopy, and the alternating group
A strong uniform time for random transpositions
Edge disjoint placement of graphs
Whitney numbers of the second kind for the star poset
Packing of graphs - a survey
Mixing times for the interchange process
A phase transition in the random transposition random walk
Sliding puzzles and rotating puzzles on graphs
Sharp phase transition in the random stirring model on trees
Compositions of random transpositions
The probability of long cycles in interchange processes
Proof of Aldous' spectral gap conjecture
Title not available (Why is that?)
On reorienting graphs by pushing down maximal vertices
Acyclic orientations of random graphs
Posets from admissible Coxeter sequences.
Powers of Coxeter elements in infinite groups are reduced
Combinatorial and computational aspects of graph packing and graph decomposition
Toric partial orders
The complexity of finding minimum-length generator sequences
Swapping labeled tokens on graphs
Title not available (Why is that?)
Complexity of token swapping and its variants
The Graph of Linear Extensions Revisited
Title not available (Why is that?)
A simple proof that the \((n^{2} - 1)\)-puzzle is hard
Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves
The interchange process on high-dimensional products
Typical and extremal aspects of friends-and-strangers graphs
On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs
An equivalence relation on the symmetric group and multiplicity-free flag \(h\)-vectors
Friends and strangers walking on graphs
Connectivity of friends-and-strangers graphs on random pairs
Friends and strangers walking on graphs
Connectedness of friends-and-strangers graphs of complete bipartite graphs and others
Reversible computation using swap reactions on a surface
Sorting on graphs by adjacent swaps using permutation groups
Token Swapping on Trees
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant
Non-separable and planar graphs.
Connectivity of old and new models of friends-and-strangers graphs

This page was built for publication: On the diameters of friends-and-strangers graphs

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