Erratum to: “The falsity of the reconstruction conjecture for tournaments”

DOI10.1002/jgt.20398zbMath1180.05053OpenAlexW4244229373WikidataQ123133961 ScholiaQ123133961MaRDI QIDQ3652551

Paul K. Stockmeyer

Publication date: 18 December 2009

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

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

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 (2)

The \(\{-2,-1\}\)-selfdual and decomposable tournaments ⋮ Are all pairs of hypomorphic digraphs \(S\)-isomorphic?

Cites Work

• On Stockmeyer's non-reconstructible tournaments
• The falsity of the reconstruction conjecture for tournaments

This page was built for publication: Erratum to: “The falsity of the reconstruction conjecture for tournaments”