The following pages link to (Q3089201):
Displaying 4 items.
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (Q2175784) (← links)
- 3-regular graphs are 2-reconstructible (Q2225421) (← links)
- The graph reconstruction number (Q3815338) (← links)
- On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices (Q5001714) (← links)