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

Abstract

top
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.

How to cite

top

Ví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 -

NotesEmbed ?

top

You must be logged in to post comments.