A census of non-reconstructable digraphs. I: Six related families
From MaRDI portal
Publication:1135862
DOI10.1016/S0095-8956(81)80027-5zbMATH Open0426.05039OpenAlexW2021673437MaRDI QIDQ1135862FDOQ1135862
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
Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- The falsity of the reconstruction conjecture for tournaments
- Graph reconstruction—a survey
- On the problem of reconstructing a tournament from subtournaments
- Reconstructing the degree pair sequence of a digraph
- On nonreconstructable tournaments
- Determining connectedness from subdigraphs
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
- A property of most of the known non-reconstructible digraphs
- Hypomorphisms, orbits, and reconstruction
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)
