A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs (Q1864218): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02684036 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033518193 / rank | |||
Normal rank | |||
Latest revision as of 10:03, 30 July 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
