1]Chen J, Archdeacon D,Gross J L. Maximum genus and connectivity.
Discrete Math, 1996, 149: 19-29
[2]Chen J,Kanchi S P, Gross J L. A tight lower bound on the
maximum genus of a simplicial graph. Discrete Mathematics, 1996, 156: 83-102
[3]Gross J L,Furst M L. Hierarchy of imbeddingdistribution
invariants of a graph. J Graph Theory, 1987, 11(2): 205-220
[4]Huang Y, Liu Y. Maximum genus and maximum nonseparating independent set of a 3regular graph. Discrete Math,
1997, 176: 149-158
[5]Nebesky L. A new characterization of the maximum genus of graphs. Czechoslovak Math J, 1981, 31: 604-613
[6]Nordhaus E A, Ringeisen R D, Stewart B M. A kuratowskitype theorem for the maximum genus ofa graph. J Combin Theory, 1972, 12B: 206-267
[7]Ore O. A problem regarding the tracing of graphs.
Elem Math, 1951, 6: 49-53
[8]Ringeisen R D. Survey of results on the maximum genus of a graph.
J Graph Theory, 1979, 3: 1-13
[9]Skoveria M. The maximum genus of graph of diameter Ⅱ.
Discrete Math, 1989, 87: 175-180
[10]Thomassen C. Bidirectional retracingfree double tracing and upper
embeddability of graphs. J Combin Theory, 1990, 50B: 198-207 |