The following pages link to A graph reconstructor's manual (Q3975132):
Displaying 50 items.
- 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)
- Graph reconstruction and quantum statistical mechanics (Q390946) (← 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)
- Lexicographic products with high reconstruction numbers (Q418863) (← links)
- Ordered sets that are reconstructible from two cards and the number of comparabilities. (Q466874) (← links)
- Prime orders all of whose prime suborders are selfdual (Q603888) (← links)
- Reconstruction of interval graphs (Q604467) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- Reconstructing infinite sets of integers (Q696913) (← links)
- Degree-associated reconstruction number of graphs (Q709303) (← 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)
- Maximal proper subgraphs of median graphs (Q878630) (← links)
- Reconstruction of a graph from 2-vicinities of its vertices (Q947081) (← links)
- The reconstruction conjecture and edge ideals (Q952662) (← links)
- Operator decomposition of graphs and the reconstruction conjecture (Q960949) (← links)
- Problems from CGCS Luminy, May 2007 (Q966173) (← links)
- On the edge reconstruction of graphs embedded in surfaces. III (Q1127882) (← links)
- The \(k\)-orbit reconstruction and the orbit algebra (Q1201909) (← links)
- Reconstructing subsets of \(\mathbb{Z}_n\) (Q1269888) (← links)
- On the edge reconstruction of graphs embedded on surfaces (Q1313356) (← links)
- Edge-reconstruction of minimally 3-connected planar graphs (Q1317958) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- Width two posets are reconstructible (Q1356683) (← links)
- Techniques in matroid reconstruction (Q1363660) (← links)
- Dense graphs and edge reconstructions (Q1375698) (← links)
- The centroidal branches of a separable graph are edge reconstructible (Q1377714) (← links)
- Reconstruction of finite truncated semi-modular lattices (Q1403920) (← links)
- Unique representability and matroid reconstruction (Q1408269) (← links)
- Reconstruction of distance hereditary 2-connected graphs (Q1637150) (← links)
- The \((\leq 5)\)-hypomorphy of digraphs up to complementation (Q1713868) (← links)
- Edge reconstruction of the Ihara zeta function (Q1753114) (← links)
- What is reconstruction for ordered sets? (Q1772277) (← links)
- Towards the reconstruction of posets (Q1842096) (← links)
- On a reconstruction problem of Harary and Manvel (Q1865368) (← links)
- Finite-type invariants for graphs and graph reconstructions (Q1881101) (← links)
- Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- Reconstructing the degree sequence of a sparse graph from a partial deck (Q2171022) (← links)
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (Q2175784) (← links)
- Reconstruction number of graphs with unique pendant vertex (Q2235292) (← links)
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments (Q2271991) (← links)
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible (Q2283214) (← links)
- The poset of graphs ordered by induced containment (Q2326334) (← links)
- Rigidity and reconstruction for graphs (Q2327716) (← links)
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves (Q2412994) (← links)
