Author:
Chen Jianer,Kanchi Saroja P.
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Chen, J.: A linear time algorithm for isomorphism of graphs of bounded average genus. Lecture Notes in Computer Science 657 (1993) 103–113
2. 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
3. Chen, J., Gross, J. L.: Kuratowski-type theorems for average genus. J. Comb. Theory Ser. B 57 (1993) 100–211
4. Chen, J., Gross, J. L., and Rieper, R. G.: Overlap matrices and imbedding distributions. Discrete Mathematics (1993) to appear
5. Chen, J. and Kanevsky, A.: On assembly of 4-connected graphs. Lecture Notes in Computer Science 657 (1993) 158–169
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithmic graph embeddings;Lecture Notes in Computer Science;1995