The following pages link to Graph reconstruction—a survey (Q4154892):
Displaying 50 items.
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph (Q282748) (← links)
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) (Q343743) (← links)
- A note on non-reconstructible 3-hypergraphs (Q343751) (← links)
- \(\{-1\}\)-self dual finite prechains and applications (Q392596) (← links)
- The \((\leq 6)\)-half-reconstructibility of digraphs (Q404400) (← links)
- Totally symmetric functions are reconstructible from identification minors (Q405190) (← links)
- The pairs of \(\{-3\}\)-hypomorphic tournaments (Q432667) (← links)
- Ordered sets that are reconstructible from two cards and the number of comparabilities. (Q466874) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Reconstructibility and perfect graphs (Q595687) (← links)
- Positive solutions for discrete boundary value problems involving the p-Laplacian with potential terms (Q630721) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- Degree-associated reconstruction number of graphs (Q709303) (← 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)
- 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)
- Vertex-switching reconstruction of subgraph numbers and triangle-free graphs (Q909676) (← links)
- The double reconstruction conjecture about finite colored hypergraphs (Q912131) (← links)
- Quotients of Peck posets (Q1057888) (← links)
- Reconstruction from vertex-switching (Q1062077) (← links)
- A family of non-reconstructible hypergraphs (Q1066163) (← links)
- On the edge reconstruction of locally finite disconnected graphs with a finite number of components (Q1071035) (← links)
- Reconstructing graphs from their k-edge deleted subgraphs (Q1077434) (← links)
- Hypomorphisms, orbits, and reconstruction (Q1077435) (← links)
- Mathematical problems and games (Q1101091) (← links)
- A semi-strong perfect graph theorem (Q1104341) (← links)
- Reconstruction of k-orbits of a permutation group (Q1120004) (← links)
- A census of non-reconstructable digraphs. I: Six related families (Q1135862) (← links)
- Sur certains tournois reconstructibles application à leurs groupes d'automorphismes (Q1141147) (← links)
- Reconstructing the degree sequence and the number of components of an infinite graph (Q1147163) (← links)
- Intersection theory for graphs (Q1153093) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs (Q1168334) (← links)
- Proof of Harary's conjecture on the reconstruction of trees (Q1169484) (← links)
- La reconstruction au sens de Ulam de certaines multirelations binaires. (The reconstruction in Ulam's sense of some binary multirelations) (Q1182878) (← links)
- Reconstruction of sequences (Q1182969) (← links)
- Two metrics in a graph theory modeling of organic chemistry (Q1183341) (← links)
- Reconstruction of infinite graphs (Q1191922) (← links)
- The degree sequence is reconstructible from \(n-1\) cards (Q1193716) (← links)
- Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems (Q1199123) (← links)
- The reconstruction of multirelations, at least one component of which is a chain (Q1200002) (← links)
- The \(k\)-orbit reconstruction and the orbit algebra (Q1201909) (← links)
- Note sur le problème de Ulam (Q1234700) (← links)
- Reconstructibility versus edge reconstructibility of infinite graphs (Q1251237) (← links)
- A test for legitimate decks (Q1255504) (← links)
- The reconstruction of maximal planar graphs. I: Recognition (Q1260041) (← links)
- The reconstruction of maximal planar graphs. II: Reconstruction (Q1260042) (← links)
- Reconstructing subsets of \(\mathbb{Z}_n\) (Q1269888) (← links)
