The Enumeration of Graph Imbeddings
暂无分享,去创建一个
[1] R. W. Robinson,et al. The matrix group of two permutation groups , 1967 .
[2] Jean Mayer,et al. Le problème des régions voisines sur les surfaces closes orientables , 1969 .
[3] D. Jackson. Counting cycles in permutations by group characters, with an application to a topological problem , 1987 .
[4] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[5] Robert G. Rieper,et al. Enumerating 2-cell imbeddings of connected graphs , 1988 .
[6] G. Ringel. Map Color Theorem , 1974 .
[7] A. Kempe. On the Geographical Problem of the Four Colours , 1879 .
[8] Timothy R. S. Walsh,et al. Hypermaps versus bipartite maps , 1975 .
[9] R. C. Read,et al. The Enumeration of Locally Restricted Graphs (I) , 1959 .
[10] Jack E. Graver,et al. Combinatorics with emphasis on the theory of graphs , 1977 .
[11] Brian L. Garman,et al. Cayley Graph Imbeddings and the Associated Block Designs , 1976 .
[12] Norman Biggs,et al. Cayley maps and symmetrical maps , 1972, Mathematical Proceedings of the Cambridge Philosophical Society.
[13] Kenneth P. Bogart,et al. Introductory Combinatorics , 1977 .
[14] G. Pólya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .
[15] R. Riddell,et al. Contributions to the theory of condensation , 1951 .
[16] Jonathan L. Gross,et al. Genus distributions for bouquets of circles , 1989, J. Comb. Theory, Ser. B.
[17] P. J. Heawood. Map-Colour Theorem , 1949 .
[18] J. H. Redfield,et al. The Theory of Group-Reduced Distributions , 1927 .
[19] Lothar Heffter. Ueber Tripelsysteme , 1897 .