Properties of non-reconstructible graphs and digraphs

MaRDI QIDQ4604111zbMATH OpenFDO

Authors

Publication date 23 February 2018

zbMATH Keywords

partial permutationhypomorphdahypomorphdahypomorphism

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Hypomorphisms, orbits, and reconstruction
• A property of most of the known non-reconstructible digraphs
• scientific article; zbMATH DE number 4097431
• \((\leq k)\)-hereditarily reconstructible digraphs
• More non-reconstructible hypergraphs

Cited in

(5)

• More non-reconstructible hypergraphs
• scientific article; zbMATH DE number 4097431 (Why is no real title available?)
• \((\leq k)\)-hereditarily reconstructible digraphs
• Hypomorphisms, orbits, and reconstruction
• A property of most of the known non-reconstructible digraphs

This page was built for publication: Properties of non-reconstructible graphs and digraphs

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