Author:
Fomin Fedor V.,Golovach Petr A.,Kratochvíl Jan
Reference32 articles.
1. A. Adachi, S. Iwata, and T. Kasai, Some combinatorial game problems require Ω(n k) time, J. ACM, 31 (1984), pp. 361–376.
2. M. Aigner and M. Fromme, A game of cops and robbers, Discrete Appl. Math., 8 (1984), pp. 1–11.
3. B. Alspach, Searching and sweeping graphs: a brief survey, Matematiche (Catania), 59 (2006), pp. 5–37.
4. T. Andreae, Note on a pursuit game played on graphs, Discrete Appl. Math., 9 (1984), pp. 111–115.
5. T. Andreae, On a pursuit game played on graphs for which a minor is excluded, J. Combin. Theory Ser. B, 41 (1986), pp. 37–47.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献