Lower bounds on the maximum genus of loopless multigraphs (Q1595253): 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/s11766-000-0031-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089430928 / rank | |||
Normal rank | |||
Revision as of 22:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on the maximum genus of loopless multigraphs |
scientific article |
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
