Upper embeddability of graphs

DOI10.1007/BF02879938zbMath0946.05035OpenAlexW1983911897MaRDI QIDQ1128130

Yuangqiu Huang, Yanpei Liu

Publication date: 2 August 2000

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02879938

zbMATH Keywords

surfaceembeddingmaximum genusBetti number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• The maximum genus of vertex-transitive graphs
• Embeddings of graphs with no short noncontractible cycles
• How to determine the maximum genus of a graph
• Upper embeddability and connectivity of graphs
• Maximum genus and connectivity
• The maximum genus of graphs of diameter two
• On locally quasiconnected graphs and their upper embeddability
• A new characterization of the maximum genus of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper embeddability of graphs