Up-embeddability of a graph by order and girth

Graphs and Combinatorics

Volumn 23, Issue 5, 2007, Pages 521-527

  Chen, Yichao ^a   Liu, Yanpei ^b  

^a CENTRAL SOUTH UNIVERSITY   (China)

^b BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

Girth; Maximum genus; Order; Up embeddable

Indexed keywords

EID: 35349019233     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-007-0746-8     Document Type: Article

References (20)

1. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, Macmillan, London 1979
2. Huang, Y.Q., Liu, Y.P.: An improvement of a theorem on the maximum genus for graphs, Math. Appl. 11, 109-112 (1998)
3. Huang, Y.Q., Liu. Y.P.: The degree-sum of nonadjacent vertices and up-embeddability of graphs, Chinese J. Contemp. Math. 19, 651-656 (1998) (in Chinese)
4. Jaeger, F., Payan, C., Xuong, N.H.: A class of upper embeddable graphs, J. Graph Theory 3, 387-391 (1979)
5. Jungerman, M.: A characterization of upper embeddable graphs, Trans. Am. Math. Soc. 241, 401-406 (1987)
6. Khomendo, N.P., Glukhov, A.D.: On upper embeddable graphs. Graph Theory, (N.P. Khomenko, ed) Izd. Akad. Nauk. Ukrain. SSR. Kiev., pp 85-87 (1977) (in Russian)
7. Kundu, S.: Bounds on number of disjoint spanning trees, J. Combin. Theory B 17, 199-203 (1974)
8. Liu, Y.P.: The maximum orientable genus of a graph, Scientia Sinica, Special Issue on Math. II, 41-55 (1979)
9. Liu, Y.P.: Embeddability in Graphs, Kluwer, Dordrecht/Boston/London, 1995
10. Nebesky, L.: Every connected, locally connected graph is upper embeddable, J. Graph Theory 3, 197-199 (1981)
11. Nebesky, L.: On locally quasiconnected graph and their upper embeddability, Czech. Math. J. 35, 162-166 (1985)
12. 2-connected graph and their upper embeddability, Czech. Math. J. 41, 731-735 (1991)
13. Nebesky, L.: A new characterization of the maximum genus of a graph, Czech. Math. J. 31, 604-613 (1981)
14. Nedela, R., Skoviera, M.: Topics in combinatorics and graph theory. R. Bodendiek and R. Henn (eds), Physicaverlay, Heideberg, pp 519-525 (1990)
15. Nordhaus, E.A., Stewart, B.M., White, A.T.: On the maximum genus of a graph, J. Combin. Theory 11, 285-267 (1971)
16. Nordhaus, E.A., Ringeisen, R.D., Stewart, B.M., White, A.T.: A Kuratowski type theorem for the maximum genus of a graph, J. Combin. Theory B 12, 260-267 (1972)
17. Skoviera, M.: On the maximum genus of graphs of diameter two, Discrete Math. 87, 175-180 (1991)
18. Skoviera, M., Nedela, R.: The maximum genus of a graph and doubly Eulerian trail, Bulletin, U. M. I. 4B, 541-545 (1990)
19. White, A.T.: Graphs, Groups and Surfaces, 2nd edn, Elsevier, Amsterdam, 1984
20. Xuong, N.H.: How to determine the maximum genus of a graph, J. Combin. Theory B 26, 217-225 (1979)