The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks

DOI10.1016/0012-365X(88)90003-9MaRDI QIDQ1109052zbMATH OpenFDO

Authors Steven E. Anacker

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(88)90003-9

zbMATH Keywords

series-parallel graphvertex-reconstructability

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Review text

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.

Recommendations

• On fixed edges and edge-reconstruction of series-parallel networks
• On the fundamental cycle set graph
• Two cases of reconstruction of separable graphs
• All graphs are set reconstructible if all 2-connected graphs are set reconstructible.
• Publication:3469127

Cites work

• A congruence theorem for trees
• scientific article; zbMATH DE number 3485836 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• scientific article; zbMATH DE number 3299378 (Why is no real title available?)
• scientific article; zbMATH DE number 3317675 (Why is no real title available?)
• Neighborhood Fixed Pendant Vertices
• On Ulam's conjecture for separable graphs

Cited in

(3)

• On the fixed edge of planar graphs with minimum degree five
• Two cases of reconstruction of separable graphs
• On fixed edges and edge-reconstruction of series-parallel networks

This page was built for publication: The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109052)