2000 character limit reached
Modular Decomposition and the Reconstruction Conjecture (1112.1509v2)
Published 7 Dec 2011 in math.CO
Abstract: We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
