On Stockmeyer's non-reconstructible tournaments

DOI10.1002/jgt.3190090406zbMath0664.05044OpenAlexW2076577998MaRDI QIDQ3815339

William L. Kocay

Publication date: 1985

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190090406

zbMATH Keywords

alternative constructive proofnon-reconstructible tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

Hypomorphisms, orbits, and reconstruction ⋮ Note on Kocay's 3-hypergraphs and Stockmeyer's tournaments ⋮ Reconstruction of small graphs and digraphs ⋮ Erratum to: “The falsity of the reconstruction conjecture for tournaments” ⋮ A family of non-reconstructible hypergraphs

Cites Work

• Unnamed Item

This page was built for publication: On Stockmeyer's non-reconstructible tournaments