Remarks on the lower bounds for the average genus
From MaRDI portal
(Redirected from Publication:475705)
Recommendations
Cites work
- scientific article; zbMATH DE number 3843773 (Why is no real title available?)
- scientific article; zbMATH DE number 4095487 (Why is no real title available?)
- A Note on a Conjecture of S. Stahl
- A tight lower bound on the maximum genus of a simplicial graph
- An obstruction to embedding graphs in surfaces
- An upper bound for the average number of regions
- Bounds for the average genus of the vertex-amalgamation of graphs
- Embedding distributions of generalized fan graphs
- Hierarchy for imbedding-distribution invariants of a graph
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- Limit points for average genus. II: 2-connected non-simplicial graphs
- Lower bounds for the average genus
- Maximum genus and girth of graphs
- On the average crosscap number. II: Bounds for a graph
- On the average genus of a graph
- On the average genus of the random graph
- Structure for a graph with average genus
Cited in
(5)
This page was built for publication: Remarks on the lower bounds for the average genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475705)
