96 lines
2.6 KiB
BibTeX
96 lines
2.6 KiB
BibTeX
% ── Foundational papers (cops-and-robbers) ──────────────────────────────────
|
|
|
|
@article{NowakowskiWinkler,
|
|
author = {Nowakowski, R. and Winkler, P.},
|
|
title = {Vertex-to-vertex pursuit in a graph},
|
|
journal = {Discrete Mathematics},
|
|
volume = {43},
|
|
year = {1983},
|
|
pages = {235--239},
|
|
}
|
|
|
|
@phdthesis{Quilliot,
|
|
author = {Quilliot, A.},
|
|
title = {Jeux et points fixes sur les graphes},
|
|
school = {Universit\'e de Paris VI},
|
|
type = {Th\`ese de 3\`eme cycle},
|
|
year = {1978},
|
|
}
|
|
|
|
@article{AignerFromme,
|
|
author = {Aigner, M. and Fromme, M.},
|
|
title = {A game of cops and robbers},
|
|
journal = {Discrete Applied Mathematics},
|
|
volume = {8},
|
|
number = {1},
|
|
year = {1984},
|
|
pages = {1--12},
|
|
}
|
|
|
|
% ── Meyniel's conjecture: bounds and partial progress ───────────────────────
|
|
|
|
@article{Frankl,
|
|
author = {Frankl, P.},
|
|
title = {Cops and robbers in graphs with large girth and {Cayley} graphs},
|
|
journal = {Discrete Applied Mathematics},
|
|
volume = {17},
|
|
year = {1987},
|
|
pages = {301--305},
|
|
}
|
|
|
|
@article{LuPeng,
|
|
author = {Lu, L. and Peng, X.},
|
|
title = {On {Meyniel}'s conjecture of the cop number},
|
|
journal = {Journal of Graph Theory},
|
|
volume = {71},
|
|
number = {2},
|
|
year = {2012},
|
|
pages = {192--205},
|
|
}
|
|
|
|
@article{ScottSudakov,
|
|
author = {Scott, A. and Sudakov, B.},
|
|
title = {A bound for the cops and robbers problem},
|
|
journal = {SIAM Journal on Discrete Mathematics},
|
|
volume = {25},
|
|
number = {3},
|
|
year = {2011},
|
|
pages = {1438--1442},
|
|
}
|
|
|
|
@article{FriezeKrivelevichLoh,
|
|
author = {Frieze, A. and Krivelevich, M. and Loh, P.-S.},
|
|
title = {Variations on cops and robbers},
|
|
journal = {Journal of Graph Theory},
|
|
volume = {69},
|
|
number = {4},
|
|
year = {2012},
|
|
pages = {383--402},
|
|
}
|
|
|
|
@article{PralatWormald,
|
|
author = {Pra{\l}at, P. and Wormald, N.},
|
|
title = {{Meyniel}'s conjecture holds for random graphs},
|
|
journal = {Random Structures \& Algorithms},
|
|
volume = {48},
|
|
number = {2},
|
|
year = {2016},
|
|
pages = {396--421},
|
|
}
|
|
|
|
@article{BradshawHosseiniMoharStacho,
|
|
author = {Bradshaw, P. and Hosseini, S. A. and Mohar, B. and Stacho, L.},
|
|
title = {On the cop number of graphs of high girth},
|
|
journal = {Journal of Graph Theory},
|
|
year = {2023},
|
|
}
|
|
|
|
@article{HMG,
|
|
author = {Hosseini, S. A. and Mohar, B. and {Gonzalez Hermosillo de la Maza}, S.},
|
|
title = {{Meyniel}'s conjecture on graphs of bounded degree},
|
|
journal = {Journal of Graph Theory},
|
|
volume = {97},
|
|
year = {2021},
|
|
pages = {401--407},
|
|
}
|