New bounds for the average genus and average number of faces of a simple graph
From MaRDI portal
Publication:6080141
DOI10.1016/J.DISC.2023.113685zbMATH Open1525.05028MaRDI QIDQ6080141FDOQ6080141
Authors: Yichao Chen, Zhicheng Gao 
Publication date: 30 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- Fast generation of cubic graphs
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- On the average genus of a graph
- Limit points for average genus. II: 2-connected non-simplicial graphs
- A tight lower bound on the maximum genus of a simplicial graph
- Lower bounds for the average genus
- On the average genus of the random graph
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- Lower bounds for the average genus of a CF-graph
- A note on lower bounds for maximum genus
- Maximum genus and connectivity
- An Introduction to Random Topological Graph Theory
- Genus polynomials and crosscap‐number polynomials for ring‐like graphs
- Maximum genus, connectivity, and Nebeský's theorem
- Random 2-cell embeddings of multistars
- Expected number of faces in a random embedding of any graph is at most linear
This page was built for publication: New bounds for the average genus and average number of faces of a simple graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080141)
