Pages that link to "Item:Q1135862"
From MaRDI portal
The following pages link to A census of non-reconstructable digraphs. I: Six related families (Q1135862):
Displaying 17 items.
- Totally symmetric functions are reconstructible from identification minors (Q405190) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Reconstructing under group actions. (Q855305) (← links)
- N-reconstructibility of non-reconstructible digraphs (Q1054747) (← links)
- Hypomorphisms, orbits, and reconstruction (Q1077435) (← links)
- On a new digraph reconstruction conjecture (Q1159216) (← links)
- Reconstruction of infinite graphs (Q1191922) (← links)
- Reconstructing subsets of \(\mathbb{Z}_n\) (Q1269888) (← links)
- The idiosyncratic polynomial of digraphs (Q2155544) (← links)
- Are all pairs of hypomorphic digraphs \(S\)-isomorphic? (Q2161275) (← links)
- Set-reconstructibility of Post classes (Q2348047) (← links)
- Hypomorphic Sperner systems and non-reconstructible functions (Q2351723) (← links)
- An Algebraic Formulation of the Graph Reconstruction Conjecture (Q2800593) (← links)
- A property of most of the known non-reconstructible digraphs (Q5074884) (← links)
- Reconstruction of small graphs and digraphs (Q5090542) (← links)
- (Q5150497) (← links)
- Seurat games on Stockmeyer graphs (Q6056811) (← links)
