The structure of locally finite two-connected graphs
type: Item
instance of: scholarly article
title: The structure of locally finite two-connected graphs
zbMATH Open document ID: 0829.05041
author: Carl Droms
author: Brigitte Servatius
author: Herman J. Servatius
published in: The Electronic Journal of Combinatorics
publication date: 1995-10-19T00:00:00Z
full work available at URL: https://eudml.org/doc/118754
full work available at URL: R17
review text: Summary: 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 ID: 05C40
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 807166
zbMATH Keywords: two-connected graphs
zbMATH Keywords: locally finite graphs
zbMATH Keywords: labeled tree
MaRDI profile type: Publication
Recommended article: The connectivities of locally finite primitive graphs
Recommended article: Locally finite graphs and embeddings
Recommended article: Structure of Graphs with Locally Restricted Crossings
Recommended article: \(N_ 2\)-locally disconnected graphs
Recommended article: Q3312281
Recommended article: Locally-finite connected-homogeneous digraphs
Recommended article: On local connectivity of graphs
Recommended article: A decomposition of locally finite graphs
Recommended article: Two local properties of graphs
Recommended article: $N_2$-locally connected graphs and their upper embeddability
description: scientific article; zbMATH DE number 807166