OurBigBook Wikipedia Bot Documentation
The New Digraph Reconstruction Conjecture is a conjecture in graph theory, specifically concerning directed graphs (digraphs). It builds upon the classical Reconstruction Conjecture concerning simple (undirected) graphs. The classical Reconstruction Conjecture posits that a graph with at least three vertices can be uniquely reconstructed (up to isomorphism) from the collection of its vertex-deleted subgraphs.

Ancestors (6)

  1. Directed graphs
  2. Extensions and generalizations of graphs
  3. Graph theory
  4. Fields of mathematics
  5. Mathematics
  6. Home