The 3-connected simple graphs of order \(n\) with minimum number of edges and their construction (Q2919703)
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: The 3-connected simple graphs of order \(n\) with minimum number of edges and their construction |
scientific article; zbMATH DE number 6090511
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 3-connected simple graphs of order \(n\) with minimum number of edges and their construction |
scientific article; zbMATH DE number 6090511 |
Statements
5 October 2012
0 references
degree sequence
0 references
3-connected simple graph
0 references
graph simplification
0 references
least edges
0 references
The 3-connected simple graphs of order \(n\) with minimum number of edges and their construction (English)
0 references
