The maximum genus on a 3-vertex-connected graph
From MaRDI portal
Publication:1576572
DOI10.1007/s003730070022zbMath0960.05041OpenAlexW1984529110MaRDI QIDQ1576572
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
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)
Related Items (2)
Maximum genus and chromatic number of graphs ⋮ 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
