On nonreconstructable tournaments

DOI10.1016/S0021-9800(70)80088-6MaRDI QIDQ5605173zbMATH OpenOpenAlexFDO

Authors E. T. Parker, L. 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)

Cited in

(8)

• 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
• Reconstruction of small graphs and digraphs
• The double reconstruction conjecture about finite colored hypergraphs

This page was built for publication: On nonreconstructable tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5605173)