The following pages link to On nonreconstructable tournaments (Q5605173):
Displaying 8 items.
- The double reconstruction conjecture about finite colored hypergraphs (Q912131) (← links)
- A census of non-reconstructable digraphs. I: Six related families (Q1135862) (← links)
- On a new digraph reconstruction conjecture (Q1159216) (← links)
- Strongly self-complementary and hereditarily isomorphic tournaments (Q1229221) (← links)
- Are all pairs of hypomorphic digraphs \(S\)-isomorphic? (Q2161275) (← links)
- Reconstructing the degree pair sequence of a digraph (Q2555081) (← links)
- Determining connectedness from subdigraphs (Q2562869) (← links)
- Reconstruction of small graphs and digraphs (Q5090542) (← links)
