Minimal Cycle Bases of Outerplanar Graphs

  • Josef Leydold
  • Peter F. Stadler
DOI: https://doi.org/10.37236/1354

Abstract

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.

Published
1998-02-27
How to Cite
Leydold, J., & Stadler, P. F. (1998). Minimal Cycle Bases of Outerplanar Graphs. The Electronic Journal of Combinatorics, 5(1), R16. https://doi.org/10.37236/1354
Issue
Volume 5 (1998)
Article Number
R16