Minimal cycle bases of outerplanar graphs (Q1381672)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1135583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal cycle bases of outerplanar graphs |
scientific article; zbMATH DE number 1135583 |
Statements
Minimal cycle bases of outerplanar graphs (English)
0 references
1 April 1998
0 references
It is shown that for 2-connected outerplanar graphs there is a unique cycle basis with length \(2| E| -| V|\), where \(E\) is the edge set and \(V\) the vertex set. They are the only Hamiltonian graphs with a cycle basis of this length.
0 references
connectivity
0 references
outerplanar graphs
0 references
cycle basis
0 references
Hamiltonian graphs
0 references
0.8891593813896179
0 references
0.8506072759628296
0 references
0.8499965071678162
0 references
0.809440016746521
0 references
