A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs (Q1864218)
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: A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs |
scientific article; zbMATH DE number 1883437
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs |
scientific article; zbMATH DE number 1883437 |
Statements
A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs (English)
0 references
17 March 2003
0 references
