N-reconstructibility of non-reconstructible digraphs

DOI10.1016/0012-365X(83)90122-XzbMath0519.05049OpenAlexW2955725459MaRDI QIDQ1054747

J. Blot

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90122-x

zbMATH Keywords

degree pairsdigraph reconstruction conjecturevertex-deleted subdigraphs

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

Are all pairs of hypomorphic digraphs \(S\)-isomorphic? ⋮ A property of most of the known non-reconstructible digraphs ⋮ Seurat games on Stockmeyer graphs ⋮ Degree-associated reconstruction number of graphs

Cites Work

• A census of non-reconstructable digraphs. I: Six related families
• On a new digraph reconstruction conjecture
• Unnamed Item

This page was built for publication: N-reconstructibility of non-reconstructible digraphs