On the diameters of friends-and-strangers graphs

Cites Work

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