Modular decomposition and the Reconstruction Conjecture

  title={Modular decomposition and the Reconstruction Conjecture},
  author={Robert Brignall and Nicholas Georgiou and Robert J. Waters},
  journal={The Journal of Combinatorics},
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. 
1 Citations

Figures from this paper

  • I. Dolinka
  • Mathematics
    Bulletin of the Australian Mathematical Society
  • 2012
Abstract An algebra A is said to be finitely related if the clone Clo(A) of its term operations is determined by a finite set of finitary relations. We prove that each finite idempotent semigroup


Almost every graph has reconstruction number three
  • B. Bollobás
  • Mathematics, Computer Science
    J. Graph Theory
  • 1990
On presente une demonstration d'une conjecture de Harary et Plantholt, donnee dans le titre
Operator decomposition of graphs and the reconstruction conjecture
We present the method of proving the reconstructibility of graph classes based on the new type of decomposition of graphs - the operator decomposition. The properties of this decomposition are
What is reconstruction for ordered sets?
This survey paper is interested in binary relations and particularly in partially ordered binary relations, and presents most of the known results on partially ordered sets and that for different kinds of reconstruction: among them the [email protected]?sse-reconstruction, the Ulam-re construction, the max- reconstruction and the set-re construction.
Ordered Sets: An Introduction
Preface * List of Figures * The Basics * Chains, Antichains and Fences * Upper and Lower Bounds * Retractions * Lattices * Truncated Lattices * The Dimension of Ordered Sets * Interval Orders *
A congruence theorem for trees.
Let A and JB be two trees with vertex sets au α2, , an and bi, b2, • ••, bn respectively. The trees are congurent, are isomorphic, or "are the same type", (Aζ^B), if there exists a one-to-one
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
It will be shown in this paper that critically indecomposable partially ordered sets are rather scarce; indeed, there are none of odd order, there is exactly one of order 4, and for each even k ⪖ 6 there are exactly two of order k .
Indecomposable graphs
  • P. Ille
  • Computer Science, Mathematics
    Discret. Math.
  • 1997
The induced subgraphs of an indecomposable graph are studied to prove that there is a subset Y o fV fulfillin9 X ~_ Y, i V Y I = 2 and G(Y) is indecomPOSable.
Recognition Problem in Reconstruction for Decomposable Relations
Let R be a binary and reflexive relation on a finite set E. A subset X of E is an interval of R if for a, b ∈ X and x ∈ E \ X, we have: R(a, x) = R(b, x) and R(x, a) = R(x, b). So ∅, E and every
La reconstruction des relations définies par interdits
Considerons la classe L des relations binaires et reflexives R de base E verifiant: 1) la relation R n'abrite pas de diamants (les diamants sont les deux tournois definis sur quatre elements abritant
Indecomposable graphs. Discrete Math
  • 1997