Permutation-partition pairs. III: Embedding distributions of linear families of graphs
From MaRDI portal
Publication:1119660
DOI10.1016/0095-8956(91)90062-OzbMath0671.05032MaRDI QIDQ1119660
Publication date: 1991
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
distribution; permutation; maximum genus; average genus; minimum genus; orientable embeddings; linear family
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
An Introduction to Random Topological Graph Theory, Log-concavity of genus distributions of ring-like families of graphs, Genus distributions for iterated claws, Genus distribution of \(P_3 \mathop\square P_n\), Genus distributions of star-ladders, Region distributions of some small diameter graphs, An upper bound for the average number of regions, Cubic graphs whose average number of regions is small, On the number of maximum genus embeddings of almost all graphs, Bounds for the average genus of the vertex-amalgamation of graphs, Stratified graphs for imbedding systems, Embedding distributions and Chebyshev polynomials, On the average crosscap number. II: Bounds for a graph, Total Embedding Distributions of Circular Ladders
Cites Work
- Region distributions of some small diameter graphs
- Region distributions of graph embeddings and Stirling numbers
- Genus distributions for two classes of graphs
- n-tuple colorings and associated graphs
- The nonorientable genus is additive
- The orientable genus is nonadditive
- Hierarchy for imbedding-distribution invariants of a graph
- Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings
- Permutation-Partition Pairs II: Bounds on the Genus of the Amalgamation of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item