Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs
- 1 May 1992
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 55 (1) , 83-103
- https://doi.org/10.1016/0095-8956(92)90033-t
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the average genus of a graphGraphs and Combinatorics, 1993
- Kuratowski-Type Theorems for Average GenusJournal of Combinatorial Theory, Series B, 1993
- Region distributions of graph embeddings and stirling numbersDiscrete Mathematics, 1990
- The graph genus problem is NP-completeJournal of Algorithms, 1989
- 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
- Hierarchy for imbedding‐distribution invariants of a graphJournal of Graph Theory, 1987
- Non-separable and planar graphsTransactions of the American Mathematical Society, 1932