COPS AND ROBBERS IN GRAPHS WITH LARGE GIRTH AND CAYLEY GRAPHS.

被引：0
|
作者：
Frankl, Peter [1 ]
机构：
[1] CNRS, Paris, Fr, CNRS, Paris, Fr
来源：
| 1600年 / 17期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
PROBABILITY
引用
收藏
相关论文
共 50 条
  • [41] Generalized Cops and Robbers: A Multi-player Pursuit Game on Graphs
    Ath. Kehagias
    Dynamic Games and Applications, 2019, 9 : 1076 - 1099
  • [42] Edge turncoat graphs in the game of cops and robbers: The good, the bad and the ugly
    Garnett, Colin
    Tarrant, Kerry
    Winter, Jeffrey
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2021, 116 : 143 - 168
  • [43] Uniquely colourable graphs and the hardness of colouring graphs of large girth
    Emden-Weinert, T
    Hougardy, S
    Kreuter, B
    COMBINATORICS PROBABILITY & COMPUTING, 1998, 7 (04): : 375 - 386
  • [44] Topological subgraphs in graphs of large girth
    Mader, W
    COMBINATORICA, 1998, 18 (03) : 405 - 412
  • [45] UNIQUELY COLORABLE GRAPHS WITH LARGE GIRTH
    BOLLOBAS, B
    SAUER, N
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1976, 28 (06): : 1340 - 1344
  • [46] COPS, ROBBERS, AND THREATENING SKELETONS: PADDED DECOMPOSITION FOR MINOR-FREE GRAPHS
    Abraham, Ittai
    Gavoille, Cyril
    Gupta, Anupam
    Neiman, Ofer
    Talwar, Kunal
    SIAM JOURNAL ON COMPUTING, 2019, 48 (03) : 1120 - 1145
  • [47] Graphs of large girth and surfaces of large systole
    Petri, Bram
    Walker, Alexander
    MATHEMATICAL RESEARCH LETTERS, 2018, 25 (06) : 1937 - 1956
  • [48] Dense minors in graphs of large girth
    Diestel R.
    Rempel C.
    Combinatorica, 2004, 25 (1) : 111 - 116
  • [49] Generating Random Graphs with Large Girth
    Bayati, Mohsen
    Montanari, Andrea
    Saberi, Amin
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 566 - 575
  • [50] Graphs with large girth not embeddable in the sphere
    Charbit, Pierre
    Thomasse, Stephan
    COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (06): : 829 - 832
12345