The maximum genus on a 3-vertex-connected graph

DOI10.1007/S003730070022MaRDI QIDQ1576572zbMATH OpenOpenAlexFDO

Authors Yuangqiu Huang

Publication date 10 May 2001

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Betti numbermaximum genus

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Connectivity (05C40)

Review text

The author shows that the maximum genus among all 3-connected graphs with loops and multiple edges and Betti number \(\beta\) is at least \(\beta (G) /3\). The proof uses Xuong's theorem relating the maximum genus to the number of odd components in a cotree.

Recommendations

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

Cited in

(8)

• Maximum genus and chromatic number of graphs
• A note on the maximum genus of 3-edge-connected nonsimple graphs
• A tight lower bound on the maximum genus of a 3-connected loopless multigraph
• scientific article; zbMATH DE number 3931037 (Why is no real title available?)
• scientific article; zbMATH DE number 495474 (Why is no real title available?)
• scientific article; zbMATH DE number 2147806 (Why is no real title available?)
• scientific article; zbMATH DE number 6424523 (Why is no real title available?)
• scientific article; zbMATH DE number 969182 (Why is no real title available?)

This page was built for publication: The maximum genus on a 3-vertex-connected graph

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