A note on minimally 3-connected graphs
Víctor Neumann-Lara ; Eduardo Rivera-Campo ; Jorge Urrutia
Discussiones Mathematicae Graph Theory, Tome 24 (2004), p. 115-123 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

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.

Publié le : 2004-01-01
EUDML-ID : urn:eudml:doc:270529 
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1218,
     author = {V\'\i ctor Neumann-Lara and Eduardo Rivera-Campo and Jorge Urrutia},
     title = {A note on minimally 3-connected graphs},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {24},
     year = {2004},
     pages = {115-123},
     zbl = {1054.05084},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1218}
}

Víctor Neumann-Lara; Eduardo Rivera-Campo; Jorge Urrutia. A note on minimally 3-connected graphs. Discussiones Mathematicae Graph Theory, Tome 24 (2004) pp. 115-123. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1218/

[000] [1] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North Holland, 1981). | Zbl 1226.05083

[001] [2] R. Halin, Untersuchungen über minimale n-fach zusammenhängende Graphen, Math. Ann. 182 (1969) 175-188, doi: 10.1007/BF01350321. | Zbl 0172.25804

[002] [3] W. Mader, Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl, J. Reine Angew. Math. 249 (1971) 201-207, doi: 10.1515/crll.1971.249.201. | Zbl 0201.26003