Lower bounds on the maximum genus of loopless multigraphs

DOI10.1007/S11766-000-0031-6MaRDI QIDQ1595253zbMATH OpenOpenAlexFDO

Authors 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

cycle rankloopless multigraphsmaximum genusorientable surface

Mathematics Subject Classification ID

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

Review text

The authors examine the maximum genus of an orientable surface on which loopless multigraphs embed. Their results give lower bounds in terms of the cycle rank \(\beta(G)\) for graphs \(G\) that are 2-edge- or 3-edge-connected. This is part of a recent series of papers investigating the relation between the maximum genus, cycle rank, and connectivity.

Recommendations

• A tight lower bound on the maximum genus of a 3-connected loopless multigraph
• A tight lower bound on the maximum genus of 3-edge connected loopless graphs
• scientific article; zbMATH DE number 1501715
• Maximum genus and girth of graphs
• Maximum genus and connectivity

Cites work

• A Characterization in of Upper-Embeddable Graphs
• A new characterization of the maximum genus of a graph
• A tight lower bound on the maximum genus of a simplicial graph
• Bounds of the number of disjoint spanning trees
• How to determine the maximum genus of a graph
• scientific article; zbMATH DE number 97632 (Why is no real title available?)
• Maximum genus and connectivity
• On the average genus of a graph
• Upper embeddability and connectivity of graphs
• Upper-embeddable graphs and related topics

Cited in

(6)

• A tight lower bound on the maximum genus of a 3-connected loopless multigraph
• Maximum genus of regular graphs
• scientific article; zbMATH DE number 1304309 (Why is no real title available?)
• scientific article; zbMATH DE number 5583076 (Why is no real title available?)
• Lower bounds for the average genus of a CF-graph
• The maximum and minimum genus of a multibranched surface

This page was built for publication: Lower bounds on the maximum genus of loopless multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1595253)