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

DOI10.1016/0012-365X(88)90003-9zbMath0655.05048MaRDI QIDQ1109052

Steven E. Anacker

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

series-parallel graphvertex-reconstructability

Mathematics Subject Classification ID

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

Related Items (1)

On the fixed edge of planar graphs with minimum degree five

Cites Work

• A congruence theorem for trees
• On Ulam's conjecture for separable graphs
• Neighborhood Fixed Pendant Vertices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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