Download PDF - A note on minimally 3-connected graphsAll rights reserved. Copyright exceptions and limitations apply

ArticleOriginal scientific text

Title

A note on minimally 3-connected graphs

Authors 1, 2, 1

Affiliations

  1. Instituto de Matemáticas, Universidad Nacional Autónoma de México, Ciudad Universitaria, México D.F. 04510
  2. Departamento de Matemáticas, Universidad Autónoma Metropolitana-Iztapalapa, Av. San Rafael Atlixco 186, México D.F. 09340

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.

Keywords

ENG
minimally 3-connected, walk double cover

Bibliography

  1. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North Holland, 1981).
  2. R. Halin, Untersuchungen über minimale n-fach zusammenhängende Graphen, Math. Ann. 182 (1969) 175-188, doi: 10.1007/BF01350321.
  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.
Discussiones Mathematicae Graph Theory
2004/24/1
Export to PBN, Opens in new tab
Pages:
115-123
Main language of publication
English
Received
2002-02-26
Accepted
2002-11-13
Published
2004

DOI: 10.7151/dmgt.1218

Exact and natural sciences