Kuratowski-type theorems for average genus
From MaRDI portal
Publication:1204482
DOI10.1006/jctb.1993.1009zbMath0776.05037OpenAlexW2071534778MaRDI QIDQ1204482
Jonathan L. Gross, Jian'er Chen
Publication date: 10 March 1993
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d26dc995e7ad59fdc7c62bbfe267d559c5ffc721
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Related Items (14)
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 ⋮ Maximum genus and connectivity ⋮ A tight lower bound on the maximum genus of a simplicial graph ⋮ Algorithmic graph embeddings ⋮ Graph ear decompositions and graph embeddings ⋮ Limit points for average genus. I: 3-connected and 2-connected simplicial graphs ⋮ Algorithmic graph embeddings ⋮ Structure for a graph with average genus ⋮ The total embedding distributions of cacti and necklaces ⋮ The average genus for bouquets of circles and dipoles ⋮ Overlap matrices and total imbedding distributions ⋮ The maximum genus, matchings and the cycle space of a graph
This page was built for publication: Kuratowski-type theorems for average genus
