A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs (Q1864218): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:59, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs |
scientific article |
Statements
A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs (English)
0 references
17 March 2003
0 references
