The Structure of Locally Finite Two-Connected Graphs

  • Carl Droms
  • Brigitte Servatius
  • Herman Servatius
DOI: https://doi.org/10.37236/1211

Abstract

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.

Published
1995-09-04
How to Cite
Droms, C., Servatius, B., & Servatius, H. (1995). The Structure of Locally Finite Two-Connected Graphs. The Electronic Journal of Combinatorics, 2(1), #R17. https://doi.org/10.37236/1211
Issue
Volume 2 (1995)
Article Number
R17