A sufficient condition on upper embeddability of graphs
From MaRDI portal
Publication:989758
DOI10.1007/s11425-009-0169-5zbMath1223.05035OpenAlexW1983947192MaRDI QIDQ989758
Guanghua Dong, Jun-Liang Cai, Yanpei Liu
Publication date: 23 August 2010
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-009-0169-5
Cites Work
- How to determine the maximum genus of a graph
- Maximum genus and maximum nonseparating independent set of a 3-regular graph
- Maximum genus and chromatic number of graphs
- Bounds of the number of disjoint spanning trees
- The maximum genus of graphs of diameter two
- On the maximum genus of a graph
- A class of upper-embeddable graphs
- A new characterization of the maximum genus of a graph
- Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
- Unnamed Item
- Unnamed Item
This page was built for publication: A sufficient condition on upper embeddability of graphs
