Author:
Zhangdong Ouyang,Jing Wang,Yuanqiu Huang
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference19 articles.
1. Bondy, J. A., Murty, U. S. R.: Graph theory with applications, Macmillan, London (1976)
2. Nordhaus, E. A., Stewart, B. M., White, A.T.: On the maximum genus of a graph. J. Combin. Theory 11, 258–267 (1971)
3. Kunda, S.: Bounds on number of disjoint spanning trees. J. Combin. Theory 17B, 199–203 (1974)
4. Payan, C., and Xoung, N. H.: Upper embeddability and conncetivity of graph. Discrete Math., J 27, 71–80 (1979)
5. Nebesky, L.: Every connected, locally connected graph is upper embeddable. J. Graph Theory 3, 197–199 (1981)