Author:
Bonato Anthony,Bruhn Henning,Diestel Reinhard,Sprüssel Philipp
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. On the reconstruction of rayless infinite forests;Andreae;J. Graph Theory,1984
2. Large families of mutually embeddable vertex-transitive graphs;Bonato;J. Graph Theory,2003
3. Mutually embeddable graphs and the tree alternative conjecture;Bonato;J. Combin. Theory Ser. B,2006
4. H. Bruhn, R. Diestel, A. Georgakopoulos, P. Sprüssel, Every rayless graph has an unfriendly partition, Combinatorica, in press.
5. Graph Theory;Diestel,2005
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献