A census of non-reconstructable digraphs. I: Six related families

DOI10.1016/S0095-8956(81)80027-5zbMath0426.05039OpenAlexW2021673437MaRDI QIDQ1135862

Paul K. Stockmeyer

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(81)80027-5

zbMATH Keywords

graph reconstruction conjecturenon-reconstructable digraphs

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

Hypomorphisms, orbits, and reconstruction ⋮ Reconstructing under group actions. ⋮ The idiosyncratic polynomial of digraphs ⋮ Are all pairs of hypomorphic digraphs \(S\)-isomorphic? ⋮ A property of most of the known non-reconstructible digraphs ⋮ Seurat games on Stockmeyer graphs ⋮ Totally symmetric functions are reconstructible from identification minors ⋮ On a new digraph reconstruction conjecture ⋮ Reconstruction of infinite graphs ⋮ Reconstruction of small graphs and digraphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ An Algebraic Formulation of the Graph Reconstruction Conjecture ⋮ Reconstructing subsets of \(\mathbb{Z}_n\) ⋮ Unnamed Item ⋮ N-reconstructibility of non-reconstructible digraphs ⋮ Set-reconstructibility of Post classes ⋮ Hypomorphic Sperner systems and non-reconstructible functions

Cites Work

• Unnamed Item
• On the problem of reconstructing a tournament from subtournaments
• Reconstructing the degree pair sequence of a digraph
• Determining connectedness from subdigraphs
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey
• On nonreconstructable tournaments

This page was built for publication: A census of non-reconstructable digraphs. I: Six related families