Reconstruction of locally finite connected graphs with two infinite wings (Q1182943)
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: Reconstruction of locally finite connected graphs with two infinite wings |
scientific article; zbMATH DE number 32466
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reconstruction of locally finite connected graphs with two infinite wings |
scientific article; zbMATH DE number 32466 |
Statements
Reconstruction of locally finite connected graphs with two infinite wings (English)
0 references
28 June 1992
0 references
A graph is \(p\)-coherent if it can be expressed as the union of a finite subgraph and \(p\) disjoint infinite subgraphs but cannot be expressed as the union of a finite subgraph and \(p+1\) disjoint infinite subgraphs. In a previous paper [J. Graph Theory 11, 497-505 (1987; Zbl 0652.05039)], the author proved that every locally finite connected \(p\)-coherent graph is reconstructible if \(p\geq 3\). Here the author proves the same result for \(p=2\).
0 references
reconstruction
0 references
locally finite connected graphs
0 references
infinite wings
0 references
