The following pages link to (Q4349617):
Displayed 12 items.
- Totally symmetric functions are reconstructible from identification minors (Q405190) (← links)
- Lexicographic products with high reconstruction numbers (Q418863) (← links)
- Equiangular lines in Euclidean spaces (Q891831) (← links)
- Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups (Q902247) (← links)
- Reconstruction of distance hereditary 2-connected graphs (Q1637150) (← links)
- Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model (Q1937885) (← links)
- The reconstruction conjecture for finite simple graphs and associated directed graphs (Q2138987) (← links)
- An Algebraic Formulation of the Graph Reconstruction Conjecture (Q2800593) (← links)
- Families of pairs of graphs with a large number of common cards (Q3553230) (← links)
- (Q5000297) (← links)
- Reconstruction of small graphs and digraphs (Q5090542) (← links)
- Recognizing connectedness from vertex-deleted subgraphs (Q5199418) (← links)