On a new digraph reconstruction conjecture
From MaRDI portal
Cites work
- A census of non-reconstructable digraphs. I: Six related families
- Determining connectedness from subdigraphs
- scientific article; zbMATH DE number 3504998 (Why is no real title available?)
- scientific article; zbMATH DE number 3258862 (Why is no real title available?)
- On nonreconstructable tournaments
- On Ulam's conjecture for separable graphs
- The falsity of the reconstruction conjecture for tournaments
Cited in
(14)- N-reconstructibility of non-reconstructible digraphs
- Some results and approaches for reconstruction conjectures
- Generalisations of hypomorphisms and reconstruction of hypergraphs
- Graphs with arbitrarily large adversary degree associated reconstruction number
- Degree associated edge reconstruction number of split graphs with biregular independent set is one
- A property of most of the known non-reconstructible digraphs
- Adversary degree associated reconstruction number of graphs
- Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree \(n-2\)
- Graph theory (algorithmic, algebraic, and metric problems)
- Degree associated edge reconstruction parameters of strong double brooms
- Seurat games on Stockmeyer graphs
- An algorithm to recover shredded random matrices
- Reconstruction of the ranks of the nonextremal cards and of ordered sets with a minmax pair of pseudo-similar points
- Degree-associated reconstruction number of graphs
This page was built for publication: On a new digraph reconstruction conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159216)