The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks (Q1109052)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4068921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks |
scientific article; zbMATH DE number 4068921 |
Statements
The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks (English)
0 references
1988
0 references
A series-parallel graph is a graph which does not contain a subdivision of the complete graph \(K_ 4\). For a certain subclass of the class of series-parallel graphs, vertex-reconstructability is established.
0 references
series-parallel graph
0 references
vertex-reconstructability
0 references
0.796566367149353
0 references
0.796566367149353
0 references
0.7792918682098389
0 references
0.7747943997383118
0 references
