2000 character limit reached
Modular Decomposition and the Reconstruction Conjecture
Published 7 Dec 2011 in math.CO | (1112.1509v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.