A congruence theorem for trees

Cited in

(only showing first 100 items - show all)

The reconstruction of a tree from its number deck
Mathematical problems and games
The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
Hyperplane reconstruction of the Tutte polynomial of a geometric lattice
Proof of Harary's conjecture on the reconstruction of trees
The edge reconstruction hypothesis is true for graphs with more than n _2\,n edges
Rélations non reconstructibles par leurs restrictions
Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
On reconstructing graphs from their sets of subgraphs
Reconstructing trees from two point deleted subtrees
Note sur le problème de Ulam
Reconstruction of finite truncated semi-modular lattices
Some work towards the proof of the reconstruction conjecture
Edge-recognizable domination numbers.
Reconstruction of posets with the same comparability graph
\((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets
On switching classes of graphs
Edge reconstruction of the Ihara zeta function
The combinatorial \(k\)-deck
What is reconstruction for ordered sets?
Towards the reconstruction of posets
Some basic observations on Kelly's conjecture for graphs
Reconstruction of a tree from its homomorphic images and other related transforms
On a reconstruction problem of Harary and Manvel
Graphs and their associated inverse semigroups
Inverse monoids of partial graph automorphisms
Reconstructing Young tableaux
Reconstructing trees from traces
Relaxed and approximate graph realizations
The reconstruction conjecture for finite simple graphs and associated directed graphs
The idiosyncratic polynomial of digraphs
Reconstructing the degree sequence of a sparse graph from a partial deck
Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
3-regular graphs are 2-reconstructible
The reconstruction of outerplanar graphs
Rigidity and reconstruction for graphs
The size of a graph is reconstructible from any \(n-2\) cards
Neighborhood degree lists of graphs
Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
Sketchy tweets: ten minute conjectures in graph theory
Hypomorphy of graphs up to complementation
On the problem of reconstructing a tournament from subtournaments
Reconstruction of maximal outerplanar graphs
A graph polynomial and its applications
Reconstructing the degree pair sequence of a digraph
Bemerkungen zur Ulam-Vermutung
Reconstructing the n-connected components of a graph
On the reconstruction of planar graphs
On vertex-weighted realizations of acyclic and general graphs
An algebraic formulation of the graph reconstruction conjecture
Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
Reconstructing cactus graphs from shortest path information (extended abstract)
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
Reconstruction of a graph from 2–vicinities of its vertices
The ally-reconstruction number of a tree with five or more vertices is three
Families of pairs of graphs with a large number of common cards
The reconstruction conjecture is true if all 2-connected graphs are reconstructible
Matchings and walks in graphs
Reconstruction of a Pair of Graphs from their Concatenations
scientific article; zbMATH DE number 3460298 (Why is no real title available?)
Graph reconstruction—a survey
Nearly acyclic graphs are reconstructible
Lexicographic products with high reconstruction numbers
On the complexity of graph reconstruction
Leaf-reconstructibility of phylogenetic networks
A note on the edge reconstruction conjecture
A survey on edge reconstruction of graphs
Some results on the reconstruction problems. p‐claw‐free, chordal, and p₄‐reducible graphs
The adversary degree-associated reconstruction number of double-brooms
Local Pauli stabilizers of symmetric hypergraph states
Recognizing generalized Sierpiński graphs
Polynomial reconstruction of the matching polynomial
On the number of edges of a graph and its complement
Reconstructing words from right-bounded-block words
Shotgun assembly of random jigsaw puzzles
Reconstructing trees from two cards
Recognizing connectedness from vertex-deleted subgraphs
On the Rigidity of Sparse Random Graphs
Reconstruction of Interval Graphs
Switching reconstruction of digraphs
On Reconstructing a Graph
Computational complexity of computing symmetries in finite-domain planning
Almost every n-vertex graph is determined by its 3 _2n-vertex subgraphs
scientific article; zbMATH DE number 7651149 (Why is no real title available?)
Realization problems on reachability sequences
Reconstructing finite sets of points in \(R^n\) up to groups of isometries
Reconstruction of interval graphs
Size reconstructibility of graphs
Shotgun reconstruction in the hypercube
Distributed Testing of Graph Isomorphism in the CONGEST Model.
Distance distributions and inverse problems for metric measure spaces
Graph realizations: maximum degree in vertex neighborhoods
2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs
On semi-reconstruction of graphs of connectivity 2
Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
Reconstructing Words from Right-Bounded-Block Words
Reconstruction and edge reconstruction of triangle-free 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)