Lower bounds on the maximum genus of loopless multigraphs

DOI10.1007/s11766-000-0031-6zbMath0967.05026OpenAlexW2089430928MaRDI QIDQ1595253

Deming Li, Yanpei Liu

Publication date: 27 August 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-0031-6

zbMATH Keywords

maximum genusorientable surfacecycle rankloopless multigraphs

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• How to determine the maximum genus of a graph
• Upper-embeddable graphs and related topics
• Upper embeddability and connectivity of graphs
• Bounds of the number of disjoint spanning trees
• Maximum genus and connectivity
• A tight lower bound on the maximum genus of a simplicial graph
• On the average 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: Lower bounds on the maximum genus of loopless multigraphs