The following pages link to (Q3504736):
Displaying 18 items.
- The \((\leq 6)\)-half-reconstructibility of digraphs (Q404400) (← links)
- On \({\mathcal C}K_ 1\)-reconstruction of a pair of graphs (Q909679) (← links)
- The reconstruction conjecture and edge ideals (Q952662) (← links)
- Operator decomposition of graphs and the reconstruction conjecture (Q960949) (← links)
- Reconstruction of hypertrees (Q1065031) (← links)
- Disproof of a conjecture in graph reconstruction theory (Q1200285) (← links)
- Graham's tree reconstruction conjecture and a Waring-type problem on partitions (Q1750663) (← links)
- On the weak reconstruction of Cartesian-product graphs (Q1916107) (← links)
- Reconstruction of a graph of order \(p\) from its \((p-1)\)-complements (Q1917719) (← links)
- \(K_{5, 5}\) is fully reconstructible in \(\mathbb{C}^3\) (Q2081511) (← links)
- A conjecture on the reconstruction of graphs from metric balls of their vertices (Q2470472) (← links)
- A new class of reconstructible graphs from some neighbourhood conditions (Q2634755) (← links)
- The \((\leq k)\)-half-reconstructability of graphs for \(7\leq k\leq 12\). (Q2828847) (← links)
- Claw‐free graphs are edge reconstructible (Q3797217) (← links)
- Class-reconstruction of total graphs (Q3809830) (← links)
- Reconstruction from the deck of ‐vertex induced subgraphs (Q4632019) (← links)
- Weak k-reconstruction of Cartesian products (Q4823308) (← links)
- 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs (Q6133663) (← links)
