The double reconstruction conjecture about finite colored hypergraphs

Beineke, 1970, On nonreconstructable tournaments, J. Combin. Theory, 9, 324, 10.1016/S0021-9800(70)80088-6 Bondy, 1969, On Kelly's congruence theorem for trees, 65, 387 Bondy, 1969, On Ulam's conjecture for separable graphs, Pacific J. Math., 31, 281, 10.2140/pjm.1969.31.281 Bondy, 1977, Graph reconstruction—A survey, J. Graph Theory, 1, 227, 10.1002/jgt.3190010306 Fisher, 1969, A counterexample to the countable version of a conjecture of Ulam, J. Combin. Theory, 7, 364, 10.1016/S0021-9800(69)80063-3 Harary, 1964, On the reconstruction of a graph from a collection of subgraphs, 47 Kantor, 1972, On incidence matrices of finite projective and affine spaces, Math. Z., 124, 315, 10.1007/BF01113923 Kelly, 1957, A congruence theorem for trees, Pacific J. Math., 7, 961, 10.2140/pjm.1957.7.961 Kocay, 1987, A family of nonreconstructible hypergraiphs, J. Combin. Theory Ser. B, 42, 46, 10.1016/0095-8956(87)90062-1 Stockmeyer, 1977, The falsity of the reconstruction conjecture for tournaments, J. Graph Theory, 1, 19, 10.1002/jgt.3190010108 Tutte, 1967, On dichromatic polynomials, J. Combin. Theory, 2, 301, 10.1016/S0021-9800(67)80032-2 Tutte, 1979, All the king's horses, 15 Tutte, 1984, 115 Weinstein, 1975, Reconstructing colored graphs, Pacific J. Math., 57, 307, 10.2140/pjm.1975.57.307