The falsity of the reconstruction conjecture for tournaments

Cited in

(47)

Reconstruction of posets with the same comparability graph
Complexity in Young's lattice
Reconstruction of distance hereditary 2-connected graphs
The idiosyncratic polynomial of digraphs
Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
Degree associated edge reconstruction number of split graphs with biregular independent set is one
Reconstruction of finite truncated semi-modular lattices
Reconstruction of infinite graphs
Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
Graph theory (algorithmic, algebraic, and metric problems)
scientific article; zbMATH DE number 7644293 (Why is no real title available?)
Hypomorphisms, orbits, and reconstruction
Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
A note on the adversary degree associated reconstruction number of graphs
The double reconstruction conjecture about finite colored hypergraphs
La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
A larger class of reconstructible tournaments
A census of non-reconstructable digraphs. I: Six related families
What is reconstruction for ordered sets?
The reconstruction of multirelations, at least one component of which is a chain
An algebraic formulation of the graph reconstruction conjecture
Some results and approaches for reconstruction conjectures
La reconstruction au sens de Ulam de certaines multirelations binaires. (The reconstruction in Ulam's sense of some binary multirelations)
Counterexamples to the Edge Reconstruction Conjecture for infinite graphs
Reconstruction of small graphs and digraphs
Recognizing indecomposability for tournaments
Width two posets are reconstructible
Note on Kocay's 3-hypergraphs and Stockmeyer's tournaments
Indecomposability graph and indecomposability recognition
Reconstructing under group actions.
The \((\leq 5)\)-hypomorphy of digraphs up to complementation
Towards the reconstruction of posets
Reconstruction of 2-connected parity graphs
Graphs with arbitrarily large adversary degree associated reconstruction number
Adversary degree associated reconstruction number of graphs
Note sur le problème de Ulam
Erratum to: “The falsity of the reconstruction conjecture for tournaments”
Seurat games on Stockmeyer graphs
On a new digraph reconstruction conjecture
Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms
Leaf-reconstructibility of phylogenetic networks
A property of most of the known non-reconstructible digraphs
Definability in the substructure ordering of simple graphs
The pairs of \(\{-3\}\)-hypomorphic tournaments
Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
Generalisations of hypomorphisms and reconstruction of hypergraphs
Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible

This page was built for publication: The falsity of the reconstruction conjecture for tournaments

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