A congruence theorem for trees
From MaRDI portal
Publication:769076
DOI10.2140/pjm.1957.7.961zbMath0078.37103OpenAlexW2003824380WikidataQ105815416 ScholiaQ105815416MaRDI QIDQ769076
Publication date: 1957
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1957.7.961
Related Items
On Reconstructing a Graph, Size reconstructibility of graphs, Shotgun reconstruction in the hypercube, 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, Unnamed Item, Reconstruction and edge reconstruction of triangle-free graphs, Theory of graph neural networks: representation and learning, Distributed Testing of Graph Isomorphism in the CONGEST Model., Reconstructing finite sets of points in \(R^n\) up to groups of isometries, Realization problems on reachability sequences, Switching Reconstruction of Digraphs, Computational Complexity of Computing Symmetries in Finite-Domain Planning, Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs, Reconstructing Words from Right-Bounded-Block Words, Reconstruction of a Pair of Graphs from their Concatenations, Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph, Reconstructing Words from Right-Bounded-Block Words, A survey on edge reconstruction of graphs, BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE, The reconstruction conjecture for finite simple graphs and associated directed graphs, Mathematical problems and games, On the reconstruction of planar graphs, Reconstructing under group actions., The idiosyncratic polynomial of digraphs, The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks, Complexity results in graph reconstruction, Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs, Reconstruction of Interval Graphs, On the complexity of graph reconstruction, Reconstructing the degree sequence of a sparse graph from a partial deck, The ally-reconstruction number of a tree with five or more vertices is three, Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices, Reconstruction of interval graphs, Leaf-Reconstructibility of Phylogenetic Networks, Some results on the reconstruction problems. p‐claw‐free, chordal, and p4‐reducible 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, Finite bands are finitely related, On vertex-weighted realizations of acyclic and general graphs, Reconstructing permutations from identification minors, Totally symmetric functions are reconstructible from identification minors, Sur certains tournois reconstructibles application à leurs groupes d'automorphismes, Functional graphs of polynomials over finite fields, Lexicographic products with high reconstruction numbers, Reconstruction of finite truncated semi-modular lattices, Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups, Sketchy tweets: ten minute conjectures in graph theory, Unnamed Item, Reconstructing degree sequences from k-vertex-deleted subgraphs, Some work towards the proof of the reconstruction conjecture, The double reconstruction conjecture about finite colored hypergraphs, Edge-recognizable domination numbers., Switching reconstruction and diophantine equations, The reconstruction conjecture is true if all 2-connected graphs are reconstructible, Hyperplane reconstruction of the Tutte polynomial of a geometric lattice, Shotgun assembly of random jigsaw puzzles, Proof of Harary's conjecture on the reconstruction of trees, 3-regular graphs are 2-reconstructible, The adversary degree-associated reconstruction number of double-brooms, Families of pairs of graphs with a large number of common cards, \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets, Reconstruction of a graph from 2-vicinities of its vertices, On switching classes of graphs, The reconstruction conjecture and edge ideals, Edge reconstruction of the Ihara zeta function, The combinatorial \(k\)-deck, Reconstructing infinite sets of integers, The reconstruction of outerplanar graphs, Graphs and their associated inverse semigroups, What is reconstruction for ordered sets?, Degree-associated reconstruction number of graphs, The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_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 cards, Reconstructing trees from two point deleted subtrees, Note sur le problème de Ulam, Graph reconstruction—a survey, Nearly acyclic graphs are reconstructible, Recognizing connectedness from vertex-deleted subgraphs, An Algebraic Formulation of the Graph Reconstruction Conjecture, Inverse monoids of partial graph automorphisms, Hypomorphy of graphs up to complementation, On the problem of reconstructing a tournament from subtournaments, Local Pauli stabilizers of symmetric hypergraph states, Fixing subgraphs and Ulam's conjecture, Reconstructing Cactus Graphs from Shortest Path Information, Reconstructing Young tableaux, Reconstruction of maximal outerplanar graphs, Reconstruction of posets with the same comparability graph, Recognizing generalized Sierpiński graphs, A graph polynomial and its applications, Reconstructing the degree pair sequence of a digraph, Bemerkungen zur Ulam-Vermutung, Matchings and walks in graphs, Reconstructing trees from traces, Reconstructing the n-connected components of a graph, Unnamed Item, Rigidity and reconstruction for graphs, Some Ulam’s reconstruction problems for quantum states, 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, Polynomial reconstruction of the matching polynomial, On the number of edges of a graph and its complement, The reconstruction of a tree from its number deck, On the power of a perturbation for testing non-isomorphism of graphs, Reconstruction of a graph from 2–vicinities of its vertices, On a reconstruction problem of Harary and Manvel, A note on the edge reconstruction conjecture, Relaxed and approximate graph realizations, On the Rigidity of Sparse Random Graphs
