An additivity theorem for the genus of a graph
暂无分享,去创建一个
[1] F. Harary,et al. Additivity of the genus of a graph , 1962 .
[2] S. R. Alpert. The genera of amalgamations of graphs , 1973 .
[3] Saul Stahl. Permutation-partition pairs: a combinatorial generalization of graph embeddings , 1980 .
[4] Dale H. Husemoller. Ramified coverings of Riemann surfaces , 1962 .
[5] Frank Harary,et al. Graph Theory , 2016 .
[6] John Grant,et al. Normalization and Axiomatization for Numerical Dependencies , 1985, Inf. Control..
[7] Gary L. Miller,et al. Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus , 1983, Inf. Control..
[8] A. White. Graphs, Groups and Surfaces , 1973 .
[9] Saul Stahl,et al. Permutation-partition pairs: a combinatorial generalization of graph embeddings , 1980 .
[10] W. T. Tutte. Combinatorial oriented maps , 1979 .
[11] I. S. Filotti,et al. An Algorithm for Imbedding Cubic Graphs in the Torus , 1980, J. Comput. Syst. Sci..
[12] Saul Stahl,et al. Blocks and the nonorientable genus of graphs , 1977, J. Graph Theory.