The Structure of Locally Finite Two-Connected Graphs

  title={The Structure of Locally Finite Two-Connected Graphs},
  author={Carl Droms and Brigitte Servatius and Herman Servatius},
  journal={Electr. J. Comb.},
We expand on Tutte’s theory of 3-blocks for 2-connected graphs, generalizing it to apply to infinite, locally finite graphs, and giving necessary and sufficient conditions for a labeled tree to be the 3-block tree of a 2-connected graph. Mathematics Subject Classification: 05C40, 05C38, and 05C05. 


Publications referenced by this paper.
Showing 1-8 of 8 references

Graph Theory

W. T. Tutte
Encyclopedia of Mathematics, Vol. 21, Cambridge University Press, Cambridge • 1984
View 10 Excerpts
Highly Influenced

Dividing a Graph into Triconnected Components

SIAM J. Comput. • 1973
View 3 Excerpts
Highly Influenced

Matroid theory

View 2 Excerpts

A combinatorial decomposition theory

W. H. Cunningham, J. Edmonds
Canad. J. Math. 32 • 1980
View 3 Excerpts

Methods of investigating the connectivity of large graphs

D. J. Kleitman
IEEE Trans. Circuit Theory, 16, 232-233 • 1969

Connectivity in Graphs

W. T. Tutte
University of Toronto Press • 1966
View 1 Excerpt

Connectivity in Matroids

W. T. Tutte
Canad. J. Math., 18 • 1966
View 1 Excerpt

2-isomorphic graphs

H. Whitney
Amer. J. Math. 55 • 1933

Similar Papers

Loading similar papers…