A congruence theorem for trees

Cited In (only showing first 100 items - show all)

The reconstruction conjecture and edge ideals
Nearly acyclic graphs are reconstructible
Rigidity and reconstruction for graphs
Reconstructing the degree pair sequence of a digraph
Reconstructing trees from two cards
Hyperplane reconstruction of the Tutte polynomial of a geometric lattice
Reconstruction of Interval Graphs
Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
Totally symmetric functions are reconstructible from identification minors
Reconstructing infinite sets of integers
The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
Lexicographic products with high reconstruction numbers
Title not available (Why is that?)
On the complexity of graph reconstruction
Switching Reconstruction of Digraphs
Finite bands are finitely related
Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
Reconstructing under group actions.
On Reconstructing a Graph
Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs
Proof of Harary's conjecture on the reconstruction of trees
Reconstructing Words from Right-Bounded-Block Words
Reconstructing Words from Right-Bounded-Block Words
On switching classes of graphs
Edge reconstruction of the Ihara zeta function
Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
The combinatorial \(k\)-deck
Mathematical problems and games
What is reconstruction for ordered sets?
On the power of a perturbation for testing non-isomorphism of graphs
Reconstruction of interval graphs
The double reconstruction conjecture about finite colored hypergraphs
The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges
On reconstructing graphs from their sets of subgraphs
Reconstructing trees from two point deleted subtrees
A note on the edge reconstruction conjecture
Reconstructing permutations from identification minors
Complexity results in graph reconstruction
Note sur le problème de Ulam
Rélations non reconstructibles par leurs restrictions
On the problem of reconstructing a tournament from subtournaments
Fixing subgraphs and Ulam's conjecture
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
Towards the reconstruction of posets
The idiosyncratic polynomial of digraphs
Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups
Matchings and walks in graphs
Some Ulam’s reconstruction problems for quantum states
Bemerkungen zur Ulam-Vermutung
Size reconstructibility of graphs
Reconstructing degree sequences from k-vertex-deleted subgraphs
Switching reconstruction and diophantine equations
The reconstruction of outerplanar graphs
Reconstruction of posets with the same comparability graph
Reconstruction of maximal outerplanar graphs
On the number of edges of a graph and its complement
The adversary degree-associated reconstruction number of double-brooms
The reconstruction of a tree from its number deck
The ally-reconstruction number of a tree with five or more vertices is three
A graph polynomial and its applications
Reconstruction of a graph from 2-vicinities of its vertices
Degree-associated reconstruction number of graphs
Hypomorphy of graphs up to complementation
Distance distributions and inverse problems for metric measure spaces
Families of pairs of graphs with a large number of common cards
Polynomial reconstruction of the matching polynomial
The reconstruction conjecture for finite simple graphs and associated directed graphs
A survey on edge reconstruction of graphs
Graph reconstruction—a survey
Graphs and their associated inverse semigroups
Reconstruction of finite truncated semi-modular lattices
3-regular graphs are 2-reconstructible
BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE
\((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets
On semi-reconstruction of graphs of connectivity 2
Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs
Relaxed and approximate graph realizations
Computational Complexity of Computing Symmetries in Finite-Domain Planning
Some work towards the proof of the reconstruction conjecture
Edge-recognizable domination numbers.
Recognizing connectedness from vertex-deleted subgraphs
Neighborhood degree lists of graphs
Local Pauli stabilizers of symmetric hypergraph states
An algebraic formulation of the graph reconstruction conjecture
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
The reconstruction conjecture is true if all 2-connected graphs are reconstructible
Reconstruction and edge reconstruction of triangle-free graphs
Inverse monoids of partial graph automorphisms
Shotgun reconstruction in the hypercube
Reconstruction of a graph from 2–vicinities of its vertices
An algorithm to recover shredded random matrices
On the Rigidity of Sparse Random Graphs
Recognizing generalized Sierpiński graphs
Reconstructing Cactus Graphs from Shortest Path Information
Theory of graph neural networks: representation and learning

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)