The falsity of the reconstruction conjecture for tournaments
From MaRDI portal
Publication:4126364
DOI10.1002/jgt.3190010108zbMath0355.05026OpenAlexW2160687009WikidataQ122958775 ScholiaQ122958775MaRDI QIDQ4126364
Publication date: 1977
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://scholarworks.wm.edu/cgi/viewcontent.cgi?article=2129&context=aspubs
Related Items (47)
Hypomorphisms, orbits, and reconstruction ⋮ Generalisations of hypomorphisms and reconstruction of hypergraphs ⋮ Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms ⋮ Reconstruction of distance hereditary 2-connected graphs ⋮ Width two posets are reconstructible ⋮ Reconstructing under group actions. ⋮ The idiosyncratic polynomial of digraphs ⋮ Note on Kocay's 3-hypergraphs and Stockmeyer's tournaments ⋮ Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) ⋮ Unnamed Item ⋮ A property of most of the known non-reconstructible digraphs ⋮ A larger class of reconstructible tournaments ⋮ Leaf-Reconstructibility of Phylogenetic Networks ⋮ Complexity in Young's lattice ⋮ A census of non-reconstructable digraphs. I: Six related families ⋮ Seurat games on Stockmeyer graphs ⋮ Sur certains tournois reconstructibles application à leurs groupes d'automorphismes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs ⋮ Reconstruction of finite truncated semi-modular lattices ⋮ The pairs of \(\{-3\}\)-hypomorphic tournaments ⋮ Indecomposability graph and indecomposability recognition ⋮ The double reconstruction conjecture about finite colored hypergraphs ⋮ On a new digraph reconstruction conjecture ⋮ The \((\leq 5)\)-hypomorphy of digraphs up to complementation ⋮ La reconstruction au sens de Ulam de certaines multirelations binaires. (The reconstruction in Ulam's sense of some binary multirelations) ⋮ Reconstruction of infinite graphs ⋮ The reconstruction of multirelations, at least one component of which is a chain ⋮ A note on the adversary degree associated reconstruction number of graphs ⋮ Reconstruction of small graphs and digraphs ⋮ What is reconstruction for ordered sets? ⋮ Note sur le problème de Ulam ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible ⋮ An Algebraic Formulation of the Graph Reconstruction Conjecture ⋮ Graphs with arbitrarily large adversary degree associated reconstruction number ⋮ Counterexamples to the Edge Reconstruction Conjecture for infinite graphs ⋮ Reconstruction of posets with the same comparability graph ⋮ Erratum to: “The falsity of the reconstruction conjecture for tournaments” ⋮ Adversary degree associated reconstruction number of graphs ⋮ Towards the reconstruction of posets ⋮ Degree associated edge reconstruction number of split graphs with biregular independent set is one ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic ⋮ Some results and approaches for reconstruction conjectures ⋮ La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations) ⋮ Definability in the substructure ordering of simple graphs
This page was built for publication: The falsity of the reconstruction conjecture for tournaments
