Generalisations of hypomorphisms and reconstruction of hypergraphs
From MaRDI portal
Publication:293609
DOI10.1007/s00373-015-1639-xzbMath1339.05261OpenAlexW1886086773MaRDI QIDQ293609
Publication date: 9 June 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1639-x
Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The double reconstruction conjecture about finite colored hypergraphs
- A family of non-reconstructible hypergraphs
- On a new digraph reconstruction conjecture
- Number of nonisomorphic subgraphs in an n-point graph
- Almost every graph has reconstruction number three
- The falsity of the reconstruction conjecture for tournaments
- Asymmetric graphs
This page was built for publication: Generalisations of hypomorphisms and reconstruction of hypergraphs
