[1]Bondy J A. Small circuit double covers of graphs. In: Hahn G, eds. Cycles and Rays. 1990. 21-40

[2]Garey M R, Johnson D S. Computers And Intractability-A Guide to the Theory of NP-Completeness. SanFrancisco: W H Freeman and Company, 1979

[3]Little C H C, Ringeisen R D. On the strong graph embedding conjecture. Proceedings of the 9th southeastern conference on combinatorics, Graph Theory and Computing. In: Utilitas Mathematica. Winnipeg,1978

[4]Liu Y P. Embeddability in Graphs. Dordrecht/Boston/London: Kluwer, 1995

[5]Liu T Y, Liu Y P. On strong embedding and circuits double covers (Submitted)

[6]Liu T Y, Liu Y P. Strong embeddings of planar near-triangulations on non-orientable surfaces. Rutgers Research Report, RRR15-2001, Feb, 2001

[7]Liu Y P. The maximum non-orientable genus of a graph (in Chinese with English abstract). Scientica Sinica, Special Issue on Math, 1979, I: 191-201

[8]Mohar B, Robertson N. Planar graphs on nonplanar surfaces. J Comb Theory, 1996, 68B: 87-111

[9]Mohar B, Robertson N, Vitray R P. Planar graphs on the projective plane. Discrete Math, 1996, 149:141-157

[10]Simone C D, Sassano A. Stability number of bull-and chair free graphs. Discrete Appl Math, 1993, 41:121-129

[11]Seymour P D, Sums of circuits. In: Bondy J A, Murty U S R, eds. Graph Theory and Related Topics.New York: Academic Press, 1979. 341-355

[12]Richter R B, Seymour P D, Siran J. Circular embedding of planar graphs in non-spherical surface. Discrete Math, 1994, 126: 273-280

[13]Zha X. The Strong embedding conjecture. Reports in Chinese Academy of Sciences, 1998

[14]Zha X. Closed 2-cell embeddings of 5-crosscap embeddable graphs. Euro J Combinatorics, 1997, 18:461-477

[15]Zhang C Q. Cycle cover theorems and their applications. Contemporary Mathematics, 1993, 147: 405-417