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

DOI10.1016/S0095-8956(81)80027-5MaRDI QIDQ1135862zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• Determining connectedness from subdigraphs
• Graph reconstruction—a survey
• On nonreconstructable tournaments
• On the problem of reconstructing a tournament from subtournaments
• Reconstructing the degree pair sequence of a digraph
• The falsity of the reconstruction conjecture for tournaments

Cited in

(16)

• On the uniqueness of exact vertex extensions
• Reconstruction of small graphs and digraphs
• Reconstruction of infinite graphs
• Reconstructing under group actions.
• Reconstructing subsets of \(\mathbb{Z}_n\)
• N-reconstructibility of non-reconstructible digraphs
• Seurat games on Stockmeyer graphs
• Graph theory (algorithmic, algebraic, and metric problems)
• An algebraic formulation of the graph reconstruction conjecture
• On a new digraph reconstruction conjecture
• Are all pairs of hypomorphic digraphs \(S\)-isomorphic?
• The idiosyncratic polynomial of digraphs
• Set-reconstructibility of Post classes
• Hypomorphic Sperner systems and non-reconstructible functions
• Hypomorphisms, orbits, and reconstruction
• A property of most of the known non-reconstructible digraphs

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

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