The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks (Q1109052): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:06, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks |
scientific article |
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
