The structure of locally finite two-connected graphs (Q1899731): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Herman J. Servatius / rank | |||
Property / author | |||
Property / author: Herman J. Servatius / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 06:09, 5 March 2024
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