N-reconstructibility of non-reconstructible digraphs

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

J. Blot

Publication date: 1983

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

zbMATH Keywords

degree pairs; digraph reconstruction conjecture; vertex-deleted subdigraphs

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)