Properties of non-reconstructible graphs and digraphs

zbMATH Open1383.05216MaRDI QIDQ4604111FDOQ4604111

Authors:

Publication date: 23 February 2018

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

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)

Cited In (4)

• More non-reconstructible hypergraphs
• Title not available (Why is that?)
• A property of most of the known non-reconstructible digraphs
• Hypomorphisms, orbits, and reconstruction

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)