Almost every graph has reconstruction number three
From MaRDI portal
Recommendations
Cited in
(38)- Composability of permutation classes
- Spectral radius, edge-disjoint cycles and cycles of the same length
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
- 3-regular graphs are 2-reconstructible
- Reconstruction number of graphs with unique pendant vertex
- Set-reconstructibility of Post classes
- An algebraic formulation of the graph reconstruction conjecture
- Reconstructing cactus graphs from shortest path information (extended abstract)
- Generalisations of hypomorphisms and reconstruction of hypergraphs
- A survey of some open questions in reconstruction numbers.
- Some Ulam's reconstruction problems for quantum states
- Bipartite permutation graphs are reconstructible
- The converse of Kelly's lemma and control-classes in graph reconstruction
- Families of pairs of graphs with a large number of common cards
- scientific article; zbMATH DE number 3900811 (Why is no real title available?)
- Lexicographic products with high reconstruction numbers
- Leaf-reconstructibility of phylogenetic networks
- Ordered sets that are reconstructible from two cards and the number of comparabilities.
- The adversary degree-associated reconstruction number of double-brooms
- On the Rigidity of Sparse Random Graphs
- Almost every graph has a fixed edge
- Reconstruction of interval graphs
- Size reconstructibility of graphs
- Shotgun reconstruction in the hypercube
- Nonsplit Graphs with Split Maximal Induced Subgraphs
- Reconstructibility of the K_r-count from n - 1 cards
- Reconstruction from one labelled card and more
- An algorithm to recover shredded random matrices
- Almost all even-particle pure states are determined by their half-body marginals
- On the reconstruction number of generalized join of graphs
- A Zykov algebra approach to clique propagation: classifying clique complexes in graphs
- A characterization of generalized cospectrality of rooted graphs with applications in graph reconstruction
- Reconstructing random pictures
- Algorithm for reconstruction number of split graphs
- Degree-associated reconstruction number of graphs
- Reconstruction of shredded random matrices
- Reconstruction from smaller cards
- Reconstructing random graphs from distance queries
This page was built for publication: Almost every graph has reconstruction number three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3480084)
