1. Chen, J.: A linear time algorithm for isomorphism of graphs of bounded average genus. Technical Report 91-015, Dept. of Computer Science, Texas A&M University (1991)
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.: Limit points for average genus (II): 2-connected non-simplicial graphs. J. Comb. Theory Ser. B (to appear)
4. Chen, J., Gross, J. L.: Kuratowski-type theorem for average genus. J. Comb. Theory Ser. B (to appear)
5. Chen, J., Gross, J. L.: No lower limit points for average genus. Graph Theory, Combinatorics, Algorithms, and Applications, Ed. Alavi and others, Wiley Interscience (to appear)