Geodesic
Generating the cycle space of planar graphs
Matthias Hamann1
1Universität Hamburg
The electronic journal of combinatorics, Tome 22 (2015) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove that the cycle space of every planar finitely separable 3-connected graph $G$ is generated by some $\operatorname{Aut}(G)$-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.
DOI : 10.37236/4924
Classification : 05C63, 05C38
Mots-clés : graph theory, planar graphs, cycle space

Matthias Hamann  1

1 Universität Hamburg 
@article{10_37236_4924,
     author = {Matthias Hamann},
     title = {Generating the cycle space of planar graphs},
     journal = {The electronic journal of combinatorics},
     year = {2015},
     volume = {22},
     number = {2},
     doi = {10.37236/4924},
     zbl = {1328.05133},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/4924/}
}
TY  - JOUR
AU  - Matthias Hamann
TI  - Generating the cycle space of planar graphs
JO  - The electronic journal of combinatorics
PY  - 2015
VL  - 22
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/4924/
DO  - 10.37236/4924
ID  - 10_37236_4924
ER  - 
%0 Journal Article
%A Matthias Hamann
%T Generating the cycle space of planar graphs
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/4924/
%R 10.37236/4924
%F 10_37236_4924
Matthias Hamann. Generating the cycle space of planar graphs. The electronic journal of combinatorics, Tome 22 (2015) no. 2. doi: 10.37236/4924

Cité par Sources :