Limit points for average genus. II: 2-connected non-simplicial graphs

DOI10.1016/0095-8956(92)90011-LzbMath0776.05036MaRDI QIDQ1204469

Jonathan L. Gross, Jian'er Chen

Publication date: 10 March 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

embeddingsnecklacesaverage genus

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (11)

On the average crosscap number. II: Bounds for a graph ⋮ Bounds for the average genus of the vertex-amalgamation of graphs ⋮ Stratified graphs for imbedding systems ⋮ A tight lower bound on the maximum genus of a simplicial graph ⋮ Algorithmic graph embeddings ⋮ New bounds for the average genus and average number of faces of a simple graph ⋮ Limit points for average genus. I: 3-connected and 2-connected simplicial graphs ⋮ Remarks on the lower bounds for the average genus ⋮ Algorithmic graph embeddings ⋮ The total embedding distributions of cacti and necklaces ⋮ Overlap matrices and total imbedding distributions

Cites Work

• Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
• Genus distributions for two classes of graphs
• Genus distributions for bouquets of circles
• Hierarchy for imbedding-distribution invariants of a graph
• Rotors in Graph Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Limit points for average genus. II: 2-connected non-simplicial graphs