Lower bounds on the maximum genus of loopless multigraphs (Q1595253)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1563599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds on the maximum genus of loopless multigraphs |
scientific article; zbMATH DE number 1563599 |
Statements
Lower bounds on the maximum genus of loopless multigraphs (English)
0 references
27 August 2001
0 references
The authors examine the maximum genus of an orientable surface on which loopless multigraphs embed. Their results give lower bounds in terms of the cycle rank \(\beta(G)\) for graphs \(G\) that are 2-edge- or 3-edge-connected. This is part of a recent series of papers investigating the relation between the maximum genus, cycle rank, and connectivity.
0 references
maximum genus
0 references
orientable surface
0 references
loopless multigraphs
0 references
cycle rank
0 references
0.8916933536529541
0 references
0.8783439993858337
0 references
0.8592252135276794
0 references
0.8437120318412781
0 references
