A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs

DOI10.1007/BF02684036zbMath1012.05058OpenAlexW2033518193MaRDI QIDQ1864218

Deming Li, Yanpei Liu

Publication date: 17 March 2003

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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
• Unnamed Item
• Unnamed Item
• How to determine the maximum genus of a graph
• Upper embeddability and connectivity of graphs
• Bounds of the number of disjoint spanning trees
• A tight lower bound on the maximum genus of a simplicial graph
• Lower Bounds For Induced Forests in Cubic Graphs
• A Characterization in of Upper-Embeddable Graphs

This page was built for publication: A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs