
doi: 10.37236/1354
2-connected outerplanar graphs have a unique minimal cycle basis with length $2\vert E\vert-\vert V\vert$. They are the only Hamiltonian graphs with a cycle basis of this length.
outerplanar graphs, Connectivity, connectivity, Preprint Series / Department of Applied Statistics and Data Processing, Switching theory, application of Boolean algebra; Boolean functions, Hamiltonian graphs, MSC 05C38, 92D20, cycle basis, Minimal Cycle Basis / Outerplanar Graphs, Paths and cycles
outerplanar graphs, Connectivity, connectivity, Preprint Series / Department of Applied Statistics and Data Processing, Switching theory, application of Boolean algebra; Boolean functions, Hamiltonian graphs, MSC 05C38, 92D20, cycle basis, Minimal Cycle Basis / Outerplanar Graphs, Paths and cycles
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 25 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
