On nonreconstructable tournaments
From MaRDI portal
Publication:5605173
DOI10.1016/S0021-9800(70)80088-6zbMath0205.28503MaRDI QIDQ5605173
E. T. Parker, Lowell W. Beineke
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(70)80088-6
05C20: Directed graphs (digraphs), tournaments
Related Items
Reconstruction of small graphs and digraphs, The double reconstruction conjecture about finite colored hypergraphs, A census of non-reconstructable digraphs. I: Six related families, On a new digraph reconstruction conjecture, Strongly self-complementary and hereditarily isomorphic tournaments, Are all pairs of hypomorphic digraphs \(S\)-isomorphic?, Reconstructing the degree pair sequence of a digraph, Determining connectedness from subdigraphs