The following pages link to (Q3059003):
Displaying 5 items.
- Complexity results in graph reconstruction (Q867853) (← links)
- Reconstruction number of graphs with unique pendant vertex (Q2235292) (← links)
- The size of a graph is reconstructible from any \(n-2\) cards (Q2411612) (← links)
- (Q3089201) (← links)
- Nonsplit Graphs with Split Maximal Induced Subgraphs (Q6154170) (← links)