Lower bounds for the average genus

DOI10.1002/JGT.3190190302MaRDI QIDQ4698079zbMATH OpenOpenAlexFDO

Authors Jonathan L. Gross, Robert G. Rieper, Jianer 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

average genuscycle ranklower bounds

Mathematics Subject Classification ID

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

Recommendations

• A tight lower bound on the maximum genus of a simplicial graph
• Lower bounds for the average genus of a CF-graph
• Remarks on the lower bounds for the average genus
• On the lower bounds for the maximum genus for simple graphs

Cites work

• The Maximum Genus of Cartesian Products of Graphs

Cited in

(12)

• Limit points for average genus. II: 2-connected non-simplicial graphs
• 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
• On the average crosscap number. II: Bounds for a graph
• Structure for a graph with average genus
• The average genus for bouquets of circles and dipoles
• Remarks on the lower bounds for the average genus
• scientific article; zbMATH DE number 861406 (Why is no real title available?)
• New bounds for the average genus and average number of faces of a simple graph
• Lower bounds for the average genus of a CF-graph
• Strong log-convexity of genus sequences

This page was built for publication: 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 Q4698079)