On the average genus of a graph
- 1 June 1993
- journal article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 9 (2-4) , 153-162
- https://doi.org/10.1007/bf02988301
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Kuratowski-Type Theorems for Average GenusJournal of Combinatorial Theory, Series B, 1993
- Limit points for average genus II. 2-Connected non-simplicial graphsJournal of Combinatorial Theory, Series B, 1992
- An upper bound for the average number of regionsJournal of Combinatorial Theory, Series B, 1991
- Region distributions of graph embeddings and stirling numbersDiscrete Mathematics, 1990
- Genus distributions for bouquets of circlesJournal of Combinatorial Theory, Series B, 1989
- Genus distributions for two classes of graphsJournal of Combinatorial Theory, Series B, 1989
- Enumerating 2-cell imbeddings of connected graphsProceedings of the American Mathematical Society, 1988
- Hierarchy for imbedding‐distribution invariants of a graphJournal of Graph Theory, 1987
- Counting cycles in permutations by group characters, with an application to a topological problemTransactions of the American Mathematical Society, 1987
- How to determine the maximum genus of a graphJournal of Combinatorial Theory, Series B, 1979