Meyniel's conjecture on graphs of bounded degree
From MaRDI portal
Publication:6080854
DOI10.1002/jgt.22662zbMath1522.05305arXiv1912.06957OpenAlexW3133769423WikidataQ113915852 ScholiaQ113915852MaRDI QIDQ6080854
Seyyed Aliasghar Hosseini, Sebastián González Hermosillo de la Maza, Bojan Mohar
Publication date: 4 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.06957
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Note on a pursuit game played on graphs
- Cops and robbers in graphs with large girth and Cayley graphs
- Game of cops and robbers in oriented quotients of the integer grid
- Cops and robbers in a random graph
- Cops and robbers on directed and undirected abelian Cayley graphs
- Meyniel's conjecture holds for random graphs
- Chasing robbers on random graphs: Zigzag theorem
- Meyniel's conjecture holds for random d‐regular graphs