A note on minimally 3-connected graphs
Víctor Neumann-Lara; Eduardo Rivera-Campo; Jorge Urrutia
Discussiones Mathematicae Graph Theory (2004)
- Volume: 24, Issue: 1, page 115-123
- ISSN: 2083-5892
Access Full Article
topAbstract
topHow to cite
topVíctor Neumann-Lara, Eduardo Rivera-Campo, and Jorge Urrutia. "A note on minimally 3-connected graphs." Discussiones Mathematicae Graph Theory 24.1 (2004): 115-123. <http://eudml.org/doc/270529>.
@article{VíctorNeumann2004,
abstract = {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.},
author = {Víctor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {minimally 3-connected; walk double cover; minimally 3-connected graph},
language = {eng},
number = {1},
pages = {115-123},
title = {A note on minimally 3-connected graphs},
url = {http://eudml.org/doc/270529},
volume = {24},
year = {2004},
}
TY - JOUR
AU - Víctor Neumann-Lara
AU - Eduardo Rivera-Campo
AU - Jorge Urrutia
TI - A note on minimally 3-connected graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2004
VL - 24
IS - 1
SP - 115
EP - 123
AB - 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.
LA - eng
KW - minimally 3-connected; walk double cover; minimally 3-connected graph
UR - http://eudml.org/doc/270529
ER -
References
top- [1] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North Holland, 1981). Zbl1226.05083
- [2] R. Halin, Untersuchungen über minimale n-fach zusammenhängende Graphen, Math. Ann. 182 (1969) 175-188, doi: 10.1007/BF01350321. Zbl0172.25804
- [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. Zbl0201.26003
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.