Remarks on the lower bounds for the average genus
From MaRDI portal
Publication:475705
DOI10.1007/s10255-011-0088-4zbMath1303.05035OpenAlexW2138878669MaRDI QIDQ475705
Publication date: 27 November 2014
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-011-0088-4
Cites Work
- Unnamed Item
- Unnamed Item
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- An upper bound for the average number of regions
- Limit points for average genus. II: 2-connected non-simplicial graphs
- An obstruction to embedding graphs in surfaces
- Maximum genus and girth of graphs
- Bounds for the average genus of the vertex-amalgamation of graphs
- A tight lower bound on the maximum genus of a simplicial graph
- On the average genus of a graph
- On the average crosscap number. II: Bounds for a graph
- Structure for a graph with average genus
- A Note on a Conjecture of S. Stahl
- Hierarchy for imbedding-distribution invariants of a graph
- Lower bounds for the average genus
- On the average genus of the random graph
- Embedding Distributions of Generalized Fan Graphs
This page was built for publication: Remarks on the lower bounds for the average genus
