Generalisations of hypomorphisms and reconstruction of hypergraphs
From MaRDI portal
Publication:293609
DOI10.1007/S00373-015-1639-XzbMATH Open1339.05261OpenAlexW1886086773MaRDI QIDQ293609FDOQ293609
Authors: Peter Czimmermann
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
Recommendations
- Mathematical Foundations of Computer Science 2005
- Generalized Dehn-Sommerville relations for hypergraphs
- Hypomorphy of graphs up to complementation
- A generalization of the Motzkin-Straus theorem to hypergraphs
- On hypohamiltonian and almost hypohamiltonian graphs
- On some general operators of hypergraphs
- scientific article; zbMATH DE number 4063134
- scientific article; zbMATH DE number 1792585
- Hypergraphs as algebraic structures
- scientific article; zbMATH DE number 3910659
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65)
Cites Work
- The falsity of the reconstruction conjecture for tournaments
- Asymmetric graphs
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The double reconstruction conjecture about finite colored hypergraphs
Cited In (4)
This page was built for publication: Generalisations of hypomorphisms and reconstruction of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293609)