Geodesic
A note on minimally 3-connected graphs
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 1, pp. 115-123

Voir la notice de l'article provenant de la source Library of Science

If G is a minimally 3-connected graph and C is a double cover of the set of edges of G by irreducible walks, then |E(G)| ≥ 2| C| - 2.
Keywords: minimally 3-connected, walk double cover 
@article{DMGT_2004_24_1_a9,
     author = {Neumann-Lara, V{\'\i}ctor and Rivera-Campo, Eduardo and Urrutia, Jorge},
     title = {A note on minimally 3-connected graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {115--123},
     publisher = {mathdoc},
     volume = {24},
     number = {1},
     year = {2004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a9/}
}
TY  - JOUR
AU  - Neumann-Lara, Víctor
AU  - Rivera-Campo, Eduardo
AU  - Urrutia, Jorge
TI  - A note on minimally 3-connected graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2004
SP  - 115
EP  - 123
VL  - 24
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a9/
LA  - en
ID  - DMGT_2004_24_1_a9
ER  - 
%0 Journal Article
%A Neumann-Lara, Víctor
%A Rivera-Campo, Eduardo
%A Urrutia, Jorge
%T A note on minimally 3-connected graphs
%J Discussiones Mathematicae. Graph Theory
%D 2004
%P 115-123
%V 24
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a9/
%G en
%F DMGT_2004_24_1_a9
Neumann-Lara, Víctor; Rivera-Campo, Eduardo; Urrutia, Jorge. A note on minimally 3-connected graphs. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 1, pp. 115-123. http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a9/