The structure of locally finite two-connected graphs (Q1899731): Difference between revisions
From MaRDI portal
Changed an Item |
Import IPFS CIDs |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreiciwoukoms7a3q5mgtmmkas72kyl73qxvjf7z4azjpbtqeima4zxe / rank | |||
Normal rank | |||
Latest revision as of 10:33, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The structure of locally finite two-connected graphs |
scientific article |
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
