On the lower bounds for the maximum genus for simple graphs
From MaRDI portal
Publication:976145
DOI10.1016/J.EJC.2009.11.001zbMATH Open1231.05078OpenAlexW2088375151MaRDI QIDQ976145FDOQ976145
Zhangdong Ouyang, Yuanqiu Huang, Jing Wang
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
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Bounds of the number of disjoint spanning trees
- How to determine the maximum genus of a graph
- A Characterization in of Upper-Embeddable Graphs
- Title not available (Why is that?)
- On the maximum genus of a graph
- Title not available (Why is that?)
- Maximum genus and girth of graphs
- A tight lower bound on the maximum genus of a simplicial graph
- A new characterization of the maximum genus of a graph
- Maximum genus, girth and connectivity
- Maximum genus and connectivity
- Maximum genus, connectivity and minimal degree of graphs
- Title not available (Why is that?)
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum genus, girth and connectivity
- Title not available (Why is that?)
- Lower bounds for the average genus of a CF-graph
- A note on directed genera of some tournaments
- Lower bounds on the maximum genus of a connected graph
- Maximum genus of regular graphs
- The bounded chromatic number for graphs of genus \(g\)
- 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)
