All graphs are set reconstructible if all 2-connected graphs are set reconstructible.

MaRDI QIDQ3624980zbMATH OpenFDO

Authors

Publication date 6 May 2009

zbMATH Keywords

graph reconstructionset reconstructionUlam's conjecture

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5914899
• On the stronger reconstruction of nearly acyclic graphs
• Two cases of reconstruction of separable graphs
• Reconstruction of distance hereditary 2-connected graphs
• Set recognition of decomposable graphs and steps towards their reconstruction

Cited in

(8)

• The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
• Two cases of reconstruction of separable graphs
• Reconstruction of the set of branches of a graph
• On the stronger reconstruction of nearly acyclic graphs
• Reconstruction of pseudographs
• Reconstruction number of separable self complementary graphs and others.
• Reconstruction of 2-connected parity graphs
• The 2-reconstructible indecomposable graphs.

This page was built for publication: All graphs are set reconstructible if all 2-connected graphs are set reconstructible.

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