Cited in
(only showing first 100 items - show all)- Reconstructibility of the \(K_r\)-count from \(n - 1\) cards
- Polynomial reconstruction problem for hypergraphs
- Reconstruction of a graph from 2-vicinities of its vertices
- Degree-associated reconstruction number of graphs
- A graph polynomial and its applications
- The ally-reconstruction number of a tree with five or more vertices is three
- Reconstruction of a Pair of Graphs from their Concatenations
- Reconstructing words from right-bounded-block words
- On a reconstruction problem of Harary and Manvel
- Bipartite permutation graphs are reconstructible
- Closeness centrality reconstruction of tree graphs
- Hypomorphy of graphs up to complementation
- On the reconstruction of planar graphs
- Families of pairs of graphs with a large number of common cards
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
- Distance distributions and inverse problems for metric measure spaces
- The degree-associated reconstruction number of an unicentroidal tree
- Polynomial invariants for rooted trees related to their random destruction
- Reconstruction from one labelled card and more
- Reconstructing trees from traces
- Polynomial reconstruction of the matching polynomial
- scientific article; zbMATH DE number 7651149 (Why is no real title available?)
- Sketchy tweets: ten minute conjectures in graph theory
- The reconstruction conjecture for finite simple graphs and associated directed graphs
- The reconstruction conjecture and edge ideals
- Reconstructing the n-connected components of a graph
- A survey on edge reconstruction of graphs
- Graph reconstruction—a survey
- 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs
- Graphs and their associated inverse semigroups
- Nearly acyclic graphs are reconstructible
- Rigidity and reconstruction for graphs
- Reconstructing the degree pair sequence of a digraph
- Hyperplane reconstruction of the Tutte polynomial of a geometric lattice
- Reconstruction of finite truncated semi-modular lattices
- Reconstructing trees from two cards
- Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
- Reconstructing infinite sets of integers
- Reconstruction of Interval Graphs
- 3-regular graphs are 2-reconstructible
- The converse of Kelly's lemma and control-classes in graph reconstruction
- The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
- Switching reconstruction of digraphs
- \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets
- Lexicographic products with high reconstruction numbers
- Relaxed and approximate graph realizations
- On semi-reconstruction of graphs of connectivity 2
- Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
- scientific article; zbMATH DE number 3460298 (Why is no real title available?)
- On the complexity of graph reconstruction
- Some work towards the proof of the reconstruction conjecture
- Edge-recognizable domination numbers.
- Reconstructing under group actions.
- Recognizing connectedness from vertex-deleted subgraphs
- Leaf-reconstructibility of phylogenetic networks
- Reconstructing cactus graphs from shortest path information (extended abstract)
- On Reconstructing a Graph
- Neighborhood degree lists of graphs
- Some Ulam's reconstruction problems for quantum states
- Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs
- Local Pauli stabilizers of symmetric hypergraph states
- Proof of Harary's conjecture on the reconstruction of trees
- Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
- On switching classes of graphs
- Mathematical problems and games
- Edge reconstruction of the Ihara zeta function
- The combinatorial \(k\)-deck
- What is reconstruction for ordered sets?
- An algebraic formulation of the graph reconstruction conjecture
- Reconstructing Words from Right-Bounded-Block Words
- On the power of a perturbation for testing non-isomorphism of graphs
- Reconstruction of interval graphs
- Reconstructing finite sets of points in \(R^n\) up to groups of isometries
- Graph realizations: maximum degree in vertex neighborhoods
- Shotgun assembly of random jigsaw puzzles
- Almost every \(n\)-vertex graph is determined by its \(3 \log_2n\)-vertex subgraphs
- The double reconstruction conjecture about finite colored hypergraphs
- The reconstruction conjecture is true if all 2-connected graphs are reconstructible
- Inverse monoids of partial graph automorphisms
- The edge reconstruction hypothesis is true for graphs with more than n _2\,n edges
- On reconstructing graphs from their sets of subgraphs
- Reconstructing trees from two point deleted subtrees
- Computational complexity of computing symmetries in finite-domain planning
- Reconstruction and edge reconstruction of triangle-free graphs
- Reconstructing permutations from identification minors
- Complexity results in graph reconstruction
- Shotgun reconstruction in the hypercube
- A note on the edge reconstruction conjecture
- Note sur le problème de Ulam
- Rélations non reconstructibles par leurs restrictions
- Reconstruction of a graph from 2–vicinities of its vertices
- On the Rigidity of Sparse Random Graphs
- An algorithm to recover shredded random matrices
- Recognizing generalized Sierpiński graphs
- Fixing subgraphs and Ulam's conjecture
- On the problem of reconstructing a tournament from subtournaments
- Functional graphs of polynomials over finite fields
- Reconstruction of a tree from its homomorphic images and other related transforms
- Some basic observations on Kelly's conjecture for graphs
This page was built for publication: A congruence theorem for trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q769076)
