Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, (1974)
2. Chen, J.: A linear time algorithm for isomorphism of graphs of bounded average genus. SIAM J. on Discrete Mathematics
7 (1994) 614–631
3. Chen, J., Archdeacon, D., and Gross, J. L.: Maximum genus and connectivity. Discrete Mathematics (1995) to appear
4. Chen, J., Gross, J. L.: Limit points for average genus I. 3-connected and 2-connected simplicial graphs. J. Comb. Theory Ser. B
55 (1992) 83–103
5. Chen, J., Gross, J. L.: Limit points for average genus II. 2-connected non-simplicial graphs. J. Comb. Theory Ser. B
56 (1992) 108–129
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithmic graph embeddings;Theoretical Computer Science;1997-07