Hostname: page-component-848d4c4894-wg55d Total loading time: 0 Render date: 2024-05-19T07:12:38.810Z Has data issue: false hasContentIssue false
  • English
  • Français

Note on the vertex 2–connectivity of a graph

Part of: Graph theory

Published online by Cambridge University Press:  26 February 2010

Dănuţ Marcu
Dănuţ Marcu
Affiliation:
Institute of Mathematics, Academiei 14, 70109–Bucharest, Romania.
Get access

Extract

In this paper we show that every finite connected graph G = (V, E), without loops and for which its spanning trees are the blocks of a balanced incomplete block design on E containing more than one block (E is the set of edges), is vertex 2–connected.

MSC classification

Secondary: 05C40: Connectivity
Type
Research Article
Information
Mathematika , Volume 35 , Issue 1 , June 1988 , pp. 69 - 71
Copyright
Copyright © University College London 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Aigner, M.. Combinatorial Theory (Springer-Verlag, 1979).CrossRefGoogle Scholar
2.Berge, C.. Théorie des Graphes et ses Applications (Dunod, 1963).Google Scholar
3.Hall, M. Jr. Combinatorial Theory (Blaisdell, Waltham, 1967).Google Scholar
4.Tutte, W. T.. Introduction to the Theory of Matroids (Elsevier, 1971).Google Scholar