The structure of locally finite two-connected graphs (Q1899731)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The structure of locally finite two-connected graphs |
scientific article; zbMATH DE number 807166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The structure of locally finite two-connected graphs |
scientific article; zbMATH DE number 807166 |
Statements
The structure of locally finite two-connected graphs (English)
0 references
19 October 1995
0 references
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.
0 references
two-connected graphs
0 references
locally finite graphs
0 references
labeled tree
0 references
0.9221002
0 references
0 references
0.9111016
0 references
0 references
0.9059822
0 references
0 references
0.9046169
0 references
0 references
