The following pages link to Size reconstructibility of graphs (Q6055396):
Displaying 9 items.
- Reconstructing graphs from cut-set sizes (Q909677) (← links)
- Graphs with a common eigenvalue deck (Q957997) (← links)
- Reconstructing the degree sequence of a sparse graph from a partial deck (Q2171022) (← links)
- The size of a graph is reconstructible from any \(n-2\) cards (Q2411612) (← links)
- Towards size reconstruction from fewer cards (Q2515598) (← links)
- The graph reconstruction number (Q3815338) (← links)
- (Q4027185) (← links)
- Reconstruction from the deck of ‐vertex induced subgraphs (Q4632019) (← links)
- Reconstructibility of the \(K_r\)-count from \(n - 1\) cards (Q6494931) (← links)
