Modular decomposition and the reconstruction conjecture

DOI10.4310/JOC.2012.V3.N1.A6zbMATH Open1267.05171arXiv1112.1509WikidataQ122939385 ScholiaQ122939385MaRDI QIDQ353407FDOQ353407

Authors: Robert Brignall, Nicholas Georgiou, Robert J. Waters 

Publication date: 12 July 2013

Published in: Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1112.1509

Mathematics Subject Classification ID

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

Cited In (3)

• Monomorphic and bimorphic partial orders
• Modular decomposition and transitive orientation
• Title not available (Why is that?)

This page was built for publication: Modular decomposition and the reconstruction conjecture

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