Author:
Müller Tobias,Prałat Paweł
Subject
Discrete Mathematics and Combinatorics
Reference27 articles.
1. Routing permutations on graphs via matchings;Alon;SIAM J. Discrete Math.,1994
2. O. Angel, I. Shinkar, A tight upper bound on acquaintance time of graphs, preprint. Available from http://arxiv.org/abs/1307.6029.
3. Hamilton cycles in random geometric graphs;Balogh;Ann. Appl. Probab.,2011
4. Acquaintance time of a graph;Benjamini;SIAM J. Discrete Math.,2014
5. Maker-breaker games on random geometric graphs;Beveridge;Random Structures Algorithms,2014
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献