The maximum genus on a 3-vertex-connected graph (Q1576572): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s003730070022 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984529110 / rank | |||
Normal rank | |||
Revision as of 00:23, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum genus on a 3-vertex-connected graph |
scientific article |
Statements
The maximum genus on a 3-vertex-connected graph (English)
0 references
10 May 2001
0 references
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.
0 references
maximum genus
0 references
Betti number
0 references
