On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs
From MaRDI portal
Publication:2143395
DOI10.1016/j.ejc.2022.103529zbMath1490.05123arXiv2107.06789OpenAlexW3182958786MaRDI QIDQ2143395
Publication date: 31 May 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.06789
connectivitybipartite graphsextremal graph theorybiconnected graphsfriends-and-strangers graphsminimum degree conditions
Related Items
Connectedness of friends-and-strangers graphs of complete bipartite graphs and others, The connectedness of the friends-and-strangers graph of a lollipop and others, Friends and strangers walking on graphs, Connectivity of old and new models of friends-and-strangers graphs, Typical and extremal aspects of friends-and-strangers graphs, Connectivity of friends-and-strangers graphs on random pairs
Cites Work