The structure of locally finite two-connected graphs

zbMath0829.05041MaRDI QIDQ1899731

Carl Droms, Brigitte Servatius, Herman J. Servatius

Publication date: 19 October 1995

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/118754

zbMATH Keywords

locally finite graphslabeled treetwo-connected graphs

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Related Items (9)

3-connected reduction for regular graph covers ⋮ The language of self-avoiding walks ⋮ Vertex Cuts ⋮ The planar Cayley graphs are effectively enumerable. II ⋮ Planar transitive graphs ⋮ Rigidity, global rigidity, and graph decomposition ⋮ Planar minimally rigid graphs and pseudo-triangulations ⋮ On the 2-sum in rigidity matroids ⋮ Generating the cycle space of planar graphs

This page was built for publication: The structure of locally finite two-connected graphs