On nonreconstructable tournaments

DOI10.1016/S0021-9800(70)80088-6zbMath0205.28503OpenAlexW1986614453MaRDI 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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Are all pairs of hypomorphic digraphs \(S\)-isomorphic? ⋮ A census of non-reconstructable digraphs. I: Six related families ⋮ The double reconstruction conjecture about finite colored hypergraphs ⋮ On a new digraph reconstruction conjecture ⋮ Reconstruction of small graphs and digraphs ⋮ Strongly self-complementary and hereditarily isomorphic tournaments ⋮ Reconstructing the degree pair sequence of a digraph ⋮ Determining connectedness from subdigraphs

This page was built for publication: On nonreconstructable tournaments