The graph reconstruction number
From MaRDI portal
Recommendations
- Graph reconstruction numbers
- Degree-associated reconstruction number of graphs
- On reconstruction of graphs
- The edge reconstruction number of a disconnected graph
- scientific article; zbMATH DE number 5942198
- scientific article; zbMATH DE number 772776
- Size reconstructibility of graphs
- Graph reconstruction by permutations
- scientific article; zbMATH DE number 1792585
- Degree associated edge reconstruction number of graphs
Cited in
(49)- Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
- scientific article; zbMATH DE number 4154485 (Why is no real title available?)
- Almost every graph has reconstruction number three
- scientific article; zbMATH DE number 7644293 (Why is no real title available?)
- Degree associated edge reconstruction number of graphs
- Graphs with arbitrarily large adversary degree associated reconstruction number
- scientific article; zbMATH DE number 3867377 (Why is no real title available?)
- scientific article; zbMATH DE number 4023332 (Why is no real title available?)
- A note on the adversary degree associated reconstruction number of graphs
- The converse of Kelly's lemma and control-classes in graph reconstruction
- Reconstruction of small graphs and digraphs
- Lexicographic products with high reconstruction numbers
- scientific article; zbMATH DE number 5077152 (Why is no real title available?)
- scientific article; zbMATH DE number 4135985 (Why is no real title available?)
- Reconstruction number of graphs with unique pendant vertex
- scientific article; zbMATH DE number 5942198 (Why is no real title available?)
- Nonsplit Graphs with Split Maximal Induced Subgraphs
- scientific article; zbMATH DE number 4130416 (Why is no real title available?)
- Class-reconstruction of total graphs
- On the edge-reconstruction number of disconnected graphs
- On the edge-reconstruction number of a tree
- Algorithm for reconstruction number of split graphs
- Largest non-unique subgraphs
- Degree associated edge reconstruction number of split graphs with biregular independent set is one
- Reconstructing finite sets of points in \(R^n\) up to groups of isometries
- Graph reconstruction numbers
- Complexity results in graph reconstruction
- scientific article; zbMATH DE number 4077274 (Why is no real title available?)
- The forcing vertex detour monophonic number of a graph
- The vertex and edge graph reconstruction numbers of small graphs
- Graph reconstruction -- some new developments
- An algorithm to recover shredded random matrices
- About the upper bound of the resulting graph reconstruction obtained by graph-component connections
- A survey of some open questions in reconstruction numbers.
- Reconstruction number of topological spaces with unique isolated point
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
- Adversary degree associated reconstruction number of graphs
- On the reconstruction number of generalized join of graphs
- The adversary degree-associated reconstruction number of double-brooms
- The size of a graph is reconstructible from any \(n-2\) cards
- Reconstruction of \((p, p+1)\)-graphs from elementary contractions
- Degree-associated reconstruction number of graphs
- The class reconstruction number of maximal planar graphs
- On a reconstruction problem of Harary and Manvel
- Progress on the reconstruction conjecture
- The degree-associated reconstruction number of an unicentroidal tree
- Reconstruction from one labelled card and more
- New problems of graph reconstruction
- The reconstruction number of a lexicographic sum of cliques
This page was built for publication: The graph reconstruction number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815338)
