A note on the maximum genus of 3-edge-connected nonsimple graphs

DOI10.1007/S11766-000-0047-YzbMath0966.05023OpenAlexW60529642MaRDI QIDQ1589799

Yuan Qiu Huang

Publication date: 10 May 2001

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-000-0047-y

zbMATH Keywords

surfacemaximum genusBetti numbercellular embeddingBetti defficiency

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to determine the maximum genus of a graph
• The maximum genus on a 3-vertex-connected graph
• Maximum genus and connectivity
• A tight lower bound on the maximum genus of a simplicial graph
• On the maximum genus of a graph
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs

This page was built for publication: A note on the maximum genus of 3-edge-connected nonsimple graphs