On the lower bounds for the maximum genus for simple graphs

DOI10.1016/J.EJC.2009.11.001MaRDI QIDQ976145zbMATH OpenOpenAlexFDO

Authors Jing Wang, Zhangdong Ouyang, Yuanqiu 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

minimum degreeBetti numbergirth

Mathematics Subject Classification ID

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

Recommendations

• Maximum genus, girth and connectivity
• Maximum genus and girth of graphs
• Maximum genus and connectivity
• A new bound on maximum genus of simple graphs.
• A note on lower bounds for maximum genus

Cites work

• scientific article; zbMATH DE number 1559120 (Why is no real title available?)
• scientific article; zbMATH DE number 951476 (Why is no real title available?)
• scientific article; zbMATH DE number 969182 (Why is no real title available?)
• A Characterization in of Upper-Embeddable Graphs
• A new characterization of the maximum genus of a graph
• A tight lower bound on the maximum genus of a simplicial graph
• Bounds of the number of disjoint spanning trees
• Graph theory
• How to determine the maximum genus of a graph
• Maximum genus and connectivity
• Maximum genus and girth of graphs
• Maximum genus, connectivity and minimal degree of graphs
• Maximum genus, girth and connectivity
• On the maximum genus of a graph

Cited in

(16)

• A new bound on maximum genus of simple graphs.
• scientific article; zbMATH DE number 5583076 (Why is no real title available?)
• A note on lower bounds for maximum genus
• Lower bounds for the maximum genus of 4-regular graphs
• scientific article; zbMATH DE number 7561610 (Why is no real title available?)
• Maximum genus, girth and connectivity
• scientific article; zbMATH DE number 5584120 (Why is no real title available?)
• Lower bounds for the average genus of a CF-graph
• A note on directed genera of some tournaments
• New bounds for the average genus and average number of faces of a simple graph
• Remarks on the lower bounds for the average genus
• Lower bounds on the maximum genus of a connected graph
• Maximum genus of regular graphs
• The bounded chromatic number for graphs of genus \(g\)
• Maximum genus, connectivity, and Nebeský's theorem
• Genus characterizes the complexity of certain graph problems: Some tight results

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976145)