The following pages link to (Q4119240):
Displaying 8 items.
- Generalisations of hypomorphisms and reconstruction of hypergraphs (Q293609) (← links)
- The adversary degree-associated reconstruction number of double-brooms (Q491632) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (Q2175784) (← links)
- 3-regular graphs are 2-reconstructible (Q2225421) (← links)
- Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs (Q5859639) (← links)
- Size reconstructibility of graphs (Q6055396) (← links)
- Minimal asymmetric hypergraphs (Q6144395) (← links)
