Connectivity of friends-and-strangers graphs on random pairs
From MaRDI portal
Publication:2111926
Recommendations
- Typical and extremal aspects of friends-and-strangers graphs
- On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs
- Friends and strangers walking on graphs
- scientific article; zbMATH DE number 903461
- Connectedness of friends-and-strangers graphs of complete bipartite graphs and others
- scientific article; zbMATH DE number 6930592
- The friendship paradox
- Publication:3203053
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- Edge disjoint placement of graphs
- Friends and strangers walking on graphs
- Graph puzzles, homotopy, and the alternating group
- On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs
- Subgraphs of graphs. I
- The probabilistic method
- Typical and extremal aspects of friends-and-strangers graphs
Cited in
(9)- Connectivity of old and new models of friends-and-strangers graphs
- On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs
- On the diameters of friends-and-strangers graphs
- Friends and strangers walking on graphs
- The connectedness of the friends-and-strangers graph of a lollipop and others
- Connectivity of friends-and-strangers graphs on random pairs
- Typical and extremal aspects of friends-and-strangers graphs
- Connectedness of friends-and-strangers graphs of complete bipartite graphs and others
- Friends and strangers walking on graphs
This page was built for publication: Connectivity of friends-and-strangers graphs on random pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111926)