Lower bounds for the average genus

DOI10.1002/jgt.3190190302zbMath0819.05022OpenAlexW1986594807MaRDI QIDQ4698079

Robert G. Rieper, Jonathan L. Gross, Jian'er Chen

Publication date: 14 May 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190190302

zbMATH Keywords

lower boundsaverage genuscycle rank

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (8)

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 ⋮ New bounds for the average genus and average number of faces of a simple graph ⋮ Remarks on the lower bounds for the average genus ⋮ Structure for a graph with average genus ⋮ The average genus for bouquets of circles and dipoles

Cites Work

• The Maximum Genus of Cartesian Products of Graphs

This page was built for publication: Lower bounds for the average genus