The following pages link to A congruence theorem for trees (Q769076):
Displaying 50 items.
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph (Q282748) (← links)
- Totally symmetric functions are reconstructible from identification minors (Q405190) (← links)
- Lexicographic products with high reconstruction numbers (Q418863) (← links)
- The adversary degree-associated reconstruction number of double-brooms (Q491632) (← links)
- Reconstruction of interval graphs (Q604467) (← links)
- Reconstructing infinite sets of integers (Q696913) (← links)
- Degree-associated reconstruction number of graphs (Q709303) (← links)
- Fixing subgraphs and Ulam's conjecture (Q759164) (← links)
- On the power of a perturbation for testing non-isomorphism of graphs (Q797996) (← links)
- Reconstructing under group actions. (Q855305) (← links)
- Complexity results in graph reconstruction (Q867853) (← links)
- Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs (Q868330) (← links)
- Reconstructing permutations from identification minors (Q888635) (← links)
- Functional graphs of polynomials over finite fields (Q895996) (← links)
- Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups (Q902247) (← links)
- Reconstructing degree sequences from k-vertex-deleted subgraphs (Q908942) (← links)
- The double reconstruction conjecture about finite colored hypergraphs (Q912131) (← links)
- Switching reconstruction and diophantine equations (Q914705) (← links)
- Reconstruction of a graph from 2-vicinities of its vertices (Q947081) (← links)
- The reconstruction conjecture and edge ideals (Q952662) (← links)
- The reconstruction of a tree from its number deck (Q1058517) (← links)
- Mathematical problems and games (Q1101091) (← links)
- The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks (Q1109052) (← links)
- Sur certains tournois reconstructibles application à leurs groupes d'automorphismes (Q1141147) (← links)
- Hyperplane reconstruction of the Tutte polynomial of a geometric lattice (Q1163564) (← links)
- Proof of Harary's conjecture on the reconstruction of trees (Q1169484) (← links)
- The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges (Q1222665) (← links)
- Rélations non reconstructibles par leurs restrictions (Q1223295) (← links)
- Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations (Q1226161) (← links)
- On reconstructing graphs from their sets of subgraphs (Q1229231) (← links)
- Reconstructing trees from two point deleted subtrees (Q1229731) (← links)
- Note sur le problème de Ulam (Q1234700) (← links)
- Reconstruction of finite truncated semi-modular lattices (Q1403920) (← links)
- Some work towards the proof of the reconstruction conjecture (Q1412674) (← links)
- Edge-recognizable domination numbers. (Q1415542) (← links)
- Reconstruction of posets with the same comparability graph (Q1569035) (← links)
- \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets (Q1741582) (← links)
- On switching classes of graphs (Q1747120) (← links)
- Edge reconstruction of the Ihara zeta function (Q1753114) (← links)
- The combinatorial \(k\)-deck (Q1756123) (← links)
- What is reconstruction for ordered sets? (Q1772277) (← links)
- Towards the reconstruction of posets (Q1842096) (← links)
- Some basic observations on Kelly's conjecture for graphs (Q1844860) (← links)
- Reconstruction of a tree from its homomorphic images and other related transforms (Q1845887) (← links)
- On a reconstruction problem of Harary and Manvel (Q1865368) (← links)
- Graphs and their associated inverse semigroups (Q2012528) (← links)
- Inverse monoids of partial graph automorphisms (Q2038891) (← links)
- Reconstructing Young tableaux (Q2068618) (← links)
- Reconstructing trees from traces (Q2075329) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
