A congruence theorem for trees

Cited in

(only showing first 100 items - show all)

Reconstruction of Interval Graphs
Distance distributions and inverse problems for metric measure spaces
Reconstruction of posets with the same comparability graph
The reconstruction of a tree from its number deck
The idiosyncratic polynomial of digraphs
The adversary degree-associated reconstruction number of double-brooms
Families of pairs of graphs with a large number of common cards
Rigidity and reconstruction for graphs
The reconstruction conjecture and edge ideals
On switching classes of graphs
Reconstructing the degree pair sequence of a digraph
Reconstructing permutations from identification minors
Edge reconstruction of the Ihara zeta function
The ally-reconstruction number of a tree with five or more vertices is three
Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
The combinatorial \(k\)-deck
Mathematical problems and games
Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
A graph polynomial and its applications
Reconstructing degree sequences from k-vertex-deleted subgraphs
Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
The double reconstruction conjecture about finite colored hypergraphs
Lexicographic products with high reconstruction numbers
Polynomial reconstruction of the matching polynomial
Switching reconstruction and diophantine equations
Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups
What is reconstruction for ordered sets?
Fixing subgraphs and Ulam's conjecture
Complexity results in graph reconstruction
Reconstruction of a tree from its homomorphic images and other related transforms
Some basic observations on Kelly's conjecture for graphs
Reconstruction of a graph from 2-vicinities of its vertices
Reconstructing trees from two cards
Matchings and walks in graphs
On the power of a perturbation for testing non-isomorphism of graphs
The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges
Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs
Degree-associated reconstruction number of graphs
Functional graphs of polynomials over finite fields
Reconstruction of interval graphs
Reconstructing under group actions.
Reconstructing words from right-bounded-block words
On reconstructing graphs from their sets of subgraphs
Reconstructing trees from two point deleted subtrees
Towards the reconstruction of posets
Note sur le problème de Ulam
Rélations non reconstructibles par leurs restrictions
scientific article; zbMATH DE number 3460298 (Why is no real title available?)
Proof of Harary's conjecture on the reconstruction of trees
On the complexity of graph reconstruction
On Reconstructing a Graph
The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
Nearly acyclic graphs are reconstructible
Reconstructing infinite sets of integers
Hyperplane reconstruction of the Tutte polynomial of a geometric lattice
The reconstruction conjecture for finite simple graphs and associated directed graphs
Reconstruction of maximal outerplanar graphs
Hypomorphy of graphs up to complementation
On the number of edges of a graph and its complement
Reconstructing Words from Right-Bounded-Block Words
A survey on edge reconstruction of graphs
Bemerkungen zur Ulam-Vermutung
The reconstruction of outerplanar graphs
A note on the edge reconstruction conjecture
Switching reconstruction of digraphs
On the problem of reconstructing a tournament from subtournaments
Some Ulam's reconstruction problems for quantum states
Graph reconstruction—a survey
Size reconstructibility of graphs
Polynomial invariants for rooted trees related to their random destruction
On the reconstruction of planar graphs
On vertex-weighted realizations of acyclic and general graphs
Reconstructing finite sets of points in \(R^n\) up to groups of isometries
On semi-reconstruction of graphs of connectivity 2
Bipartite permutation graphs are reconstructible
An algorithm to recover shredded random matrices
The converse of Kelly's lemma and control-classes in graph reconstruction
Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
Reconstruction of finite truncated semi-modular lattices
Some results on the reconstruction problems. p‐claw‐free, chordal, and p₄‐reducible graphs
Reconstruction and edge reconstruction of triangle-free graphs
Graph realizations: maximum degree in vertex neighborhoods
Relaxed and approximate graph realizations
On the Rigidity of Sparse Random Graphs
Sketchy tweets: ten minute conjectures in graph theory
Inverse monoids of partial graph automorphisms
scientific article; zbMATH DE number 7651149 (Why is no real title available?)
On a reconstruction problem of Harary and Manvel
Reconstructibility of the \(K_r\)-count from \(n - 1\) cards
Polynomial reconstruction problem for hypergraphs
Reconstruction of a Pair of Graphs from their Concatenations
Almost every \(n\)-vertex graph is determined by its \(3 \log_2n\)-vertex subgraphs
Recognizing connectedness from vertex-deleted subgraphs
Neighborhood degree lists of graphs
An algebraic formulation of the graph reconstruction conjecture
Recognizing generalized Sierpiński graphs
Shotgun assembly of random jigsaw puzzles
Distributed Testing of Graph Isomorphism in the CONGEST Model.
Reconstruction from one labelled card and more
3-regular graphs are 2-reconstructible

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)