Two cases of reconstruction of separable graphs

DOI10.12732/IJPAM.V90I1.4MaRDI QIDQ5413416zbMATH OpenOpenAlexFDO

Authors Martin Dowd

Publication date 30 April 2014

Published in International Journal of Pure and Apllied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.ijpam.eu/contents/2014-90-1/4/index.html

zbMATH Keywords

reconstructibilityseparability

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Publication:3469127
• All graphs are set reconstructible if all 2-connected graphs are set reconstructible.
• scientific article; zbMATH DE number 4016946
• The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
• Reconstruction of the set of branches of a graph

Cited in

(8)

• On one-way functions and polynomial-time isomorphisms
• The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
• The centroidal branches of a separable graph are edge reconstructible
• Reconstruction of the set of branches of a graph
• Reconstruction number of separable self complementary graphs and others.
• scientific article; zbMATH DE number 4016946 (Why is no real title available?)
• scientific article; zbMATH DE number 4135987 (Why is no real title available?)
• All graphs are set reconstructible if all 2-connected graphs are set reconstructible.

This page was built for publication: Two cases of reconstruction of separable graphs

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