The maximum genus on a 3-vertex-connected graph

DOI10.1007/S003730070022zbMATH Open0960.05041OpenAlexW1984529110MaRDI QIDQ1576572FDOQ1576572

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

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

zbMATH Keywords

Betti numbermaximum genus

Mathematics Subject Classification ID

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

Cited In (8)

• A tight lower bound on the maximum genus of a 3-connected loopless multigraph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximum genus and chromatic number of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the maximum genus of 3-edge-connected nonsimple graphs

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)