The maximum genus on a 3-vertex-connected graph (Q1576572)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The maximum genus on a 3-vertex-connected graph |
scientific article; zbMATH DE number 1491659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum genus on a 3-vertex-connected graph |
scientific article; zbMATH DE number 1491659 |
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
0.8777984976768494
0 references
0.8355898857116699
0 references
0.8265255093574524
0 references
