On the lower bounds for the maximum genus for simple graphs

DOI10.1016/j.ejc.2009.11.001zbMath1231.05078OpenAlexW2088375151MaRDI QIDQ976145

Jing Wang, Zhang Dong Ouyang, Yuan Qiu Huang

Publication date: 17 June 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.11.001

zbMATH Keywords

girthminimum degreeBetti number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (2)

Unnamed Item ⋮ A note on directed genera of some tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to determine the maximum genus of a graph
• Maximum genus and girth of graphs
• Maximum genus, girth and connectivity
• Bounds of the number of disjoint spanning trees
• Maximum genus and connectivity
• A tight lower bound on the maximum genus of a simplicial graph
• On the maximum genus of a graph
• Maximum genus, connectivity and minimal degree of graphs
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs

This page was built for publication: On the lower bounds for the maximum genus for simple graphs