The following pages link to A graph reconstructor's manual (Q3975132):
Displaying 28 items.
- Sketchy tweets: ten minute conjectures in graph theory (Q2429454) (← links)
- A reduction of the graph reconstruction conjecture (Q2509541) (← links)
- Hypomorphy of graphs up to complementation (Q2519016) (← links)
- Reconstructing the number of blocks of an infinite graph (Q2566150) (← links)
- On the reconstruction of planar graphs (Q2642012) (← links)
- Reconstruction of a coloring from its homogeneous sets (Q2680357) (← links)
- Reconstructing compact metrizable spaces (Q2832841) (← links)
- On the reconstruction of graph invariants (Q2851492) (← links)
- A TOPOLOGICAL VARIATION OF THE RECONSTRUCTION CONJECTURE (Q2976253) (← links)
- (Q3374778) (← links)
- Reconstruction of a graph from 2–vicinities of its vertices (Q3439285) (← links)
- Bipartite operator decomposition of graphs and the reconstruction conjecture (Q3503474) (← links)
- (Q4691781) (← links)
- Some results on the reconstruction problems. <i>p</i>‐claw‐free, chordal, and <i>p</i><sub>4</sub>‐reducible graphs (Q4842708) (← links)
- (Q4963168) (← links)
- (Q5000297) (← links)
- (Q5005153) (← links)
- Degree associated edge reconstruction number of split graphs with biregular independent set is one (Q5012380) (← links)
- Reconstruction of Interval Graphs (Q5323055) (← links)
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic (Q5863935) (← links)
- (Q5871578) (← links)
- Reconstructing finite sets of points in \(R^n\) up to groups of isometries (Q5952158) (← links)
- Size reconstructibility of graphs (Q6055396) (← links)
- Seurat games on Stockmeyer graphs (Q6056811) (← links)
- Shotgun reconstruction in the hypercube (Q6074678) (← links)
- Nonsplit Graphs with Split Maximal Induced Subgraphs (Q6154170) (← links)
- Morphology of the connected components of the Boolean sum of two digraphs \((\le 5)\)-hypomorphic up to complementation (Q6629785) (← links)
- Decks of rooted binary trees (Q6655698) (← links)
