Enumerating 2-cell imbeddings of connected graphs
Open Access
- 1 January 1988
- journal article
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 103 (1) , 321-330
- https://doi.org/10.1090/s0002-9939-1988-0938690-1
Abstract
A systematic approach is developed for enumerating congruence classes of -cell imbeddings of connected graphs on closed orientable -manifolds. The method is applied to the wheel graphs and to the complete graphs. Congruence class genus polynomials and congruence class imbedding polynomials are introduced, to summarize important information refining the enumeration.Keywords
This publication has 3 references indexed in Scilit:
- Hierarchy for imbedding‐distribution invariants of a graphJournal of Graph Theory, 1987
- Permutation Groups and Combinatorial StructuresPublished by Cambridge University Press (CUP) ,1979
- Automorphisms of imbedded graphsJournal of Combinatorial Theory, Series B, 1971