A tight lower bound on the maximum genus of a 3-connected loopless multigraph

DOI10.1007/s11766-000-0032-5zbMath0969.05019OpenAlexW2011639612MaRDI QIDQ1595254

Deming Li, Yanpei Liu

Publication date: 11 February 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-0032-5

zbMATH Keywords

lower boundmaximum genusloopless multigraph

Mathematics Subject Classification ID

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

Cites Work

• How to determine the maximum genus of a graph
• Upper embeddability and connectivity of graphs
• Lower bounds on the maximum genus of loopless multigraphs
• A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs
• Maximum genus and connectivity
• A tight lower bound on the maximum genus of a simplicial graph
• On the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs
• Survey of results on the maximum genus of a graph

This page was built for publication: A tight lower bound on the maximum genus of a 3-connected loopless multigraph