Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference27 articles.
1. Randomized pursuit-evasion in graphs;Adler;Combin. Probab. Comput.,2003
2. A game of cops and robbers;Aigner;Discrete Appl. Math.,1984
3. The number of components in random linear graph;Austin;Ann. Math. Statist.,1959
4. Thresholds for families of multisets, with an application to graph pebbling;Bekmetjev;Discrete Math.,2003
5. Graph Theory: An Introductory Course;Bollobás,1979
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Weight Function Lemma for graph pebbling;Journal of Combinatorial Optimization;2016-01-25
2. Graph Pebbling;Discrete Mathematics and Its Applications;2013-11-26
3. General graph pebbling;Discrete Applied Mathematics;2013-06