Pages that link to "Item:Q1412674"

The following pages link to Some work towards the proof of the reconstruction conjecture (Q1412674):

Displaying 11 items.

• Non-recursively constructible recursive families of graphs (Q426873) (← links)
• Reconstruction of distance hereditary 2-connected graphs (Q1637150) (← links)
• On the reconstruction of the matching polynomial and the reconstruction conjecture (Q1820796) (← links)
• Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible (Q2283214) (← links)
• A reduction of the graph reconstruction conjecture (Q2509541) (← links)
• (Q3344021) (← links)
• (Q3684155) (← links)
• On the Algorithmic Complexity of Minkowski's Reconstruction Theorem (Q3839902) (← links)
• (Q5000297) (← links)
• Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs (Q6151923) (← links)
• Reconstruction and edge reconstruction of triangle-free graphs (Q6184530) (← links)