Enumerating $2$-cell imbeddings of connected graphs
HTML articles powered by AMS MathViewer
- by Bruce P. Mull, Robert G. Rieper and Arthur T. White PDF
- Proc. Amer. Math. Soc. 103 (1988), 321-330 Request permission
Abstract:
A systematic approach is developed for enumerating congruence classes of $2$-cell imbeddings of connected graphs on closed orientable $2$-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.References
- Norman Biggs, Automorphisms of imbedded graphs, J. Combinatorial Theory Ser. B 11 (1971), 132–138. MR 286712, DOI 10.1016/0095-8956(71)90023-2
- N. L. Biggs and A. T. White, Permutation groups and combinatorial structures, London Mathematical Society Lecture Note Series, vol. 33, Cambridge University Press, Cambridge-New York, 1979. MR 540889
- Jonathan L. Gross and Merrick L. Furst, Hierarchy for imbedding-distribution invariants of a graph, J. Graph Theory 11 (1987), no. 2, 205–220. MR 889353, DOI 10.1002/jgt.3190110211
- Kenneth H. Rosen, Elementary number theory and its applications, 4th ed., Addison-Wesley, Reading, MA, 2000. MR 1739433
- Arthur T. White, Graphs, groups and surfaces, 2nd ed., North-Holland Mathematics Studies, vol. 8, North-Holland Publishing Co., Amsterdam, 1984. MR 780555
Additional Information
- © Copyright 1988 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 103 (1988), 321-330
- MSC: Primary 05C10; Secondary 05C30
- DOI: https://doi.org/10.1090/S0002-9939-1988-0938690-1
- MathSciNet review: 938690