The following pages link to (Q4386292):
Displaying 12 items.
- Stories about groups and sequences (Q677164) (← links)
- Reconstructing infinite sets of integers (Q696913) (← links)
- Reconstructing under group actions. (Q855305) (← links)
- Reconstructing subsets of \(\mathbb{Z}_n\) (Q1269888) (← links)
- Reconstruction of distance hereditary 2-connected graphs (Q1637150) (← links)
- Efficient reconstruction of partitions (Q1779499) (← links)
- Reconstructing Young tableaux (Q2068618) (← links)
- Reconstruction number of graphs with unique pendant vertex (Q2235292) (← links)
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible (Q2283214) (← links)
- Reconstructing compositions (Q2477377) (← links)
- A reduction of the graph reconstruction conjecture (Q2509541) (← links)
- (Q5000297) (← links)
