The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks (Q1109052): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q689954 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Thomas Andreae / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Neighborhood Fixed Pendant Vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Ulam's conjecture for separable graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5581298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A congruence theorem for trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4068750 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5597453 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5524326 / rank | |||
Normal rank | |||
Latest revision as of 18:02, 18 June 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
