Geodesic
Minimal cycle bases of outerplanar graphs
The electronic journal of combinatorics, Tome 5 (1998)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1354
Classification : 05C38, 05C40
Mots-clés : connectivity, outerplanar graphs, cycle basis, Hamiltonian graphs 
@article{10_37236_1354,
     author = {Josef Leydold and Peter F. Stadler},
     title = {Minimal cycle bases of outerplanar graphs},
     journal = {The electronic journal of combinatorics},
     year = {1998},
     volume = {5},
     doi = {10.37236/1354},
     zbl = {0895.05032},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1354/}
}
TY  - JOUR
AU  - Josef Leydold
AU  - Peter F. Stadler
TI  - Minimal cycle bases of outerplanar graphs
JO  - The electronic journal of combinatorics
PY  - 1998
VL  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1354/
DO  - 10.37236/1354
ID  - 10_37236_1354
ER  - 
%0 Journal Article
%A Josef Leydold
%A Peter F. Stadler
%T Minimal cycle bases of outerplanar graphs
%J The electronic journal of combinatorics
%D 1998
%V 5
%U http://geodesic.mathdoc.fr/articles/10.37236/1354/
%R 10.37236/1354
%F 10_37236_1354
Josef Leydold; Peter F. Stadler. Minimal cycle bases of outerplanar graphs. The electronic journal of combinatorics, Tome 5 (1998). doi: 10.37236/1354

Cité par Sources :