A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs (Q1864218): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:31, 1 February 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
