Pages that link to "Item:Q2411612"
From MaRDI portal
The following pages link to The size of a graph is reconstructible from any \(n-2\) cards (Q2411612):
Displaying 7 items.
- Reconstructing the degree sequence of a sparse graph from a partial deck (Q2171022) (← links)
- Towards size reconstruction from fewer cards (Q2515598) (← links)
- On pairs of graphs having \(n-2\) cards in common. (Q2828914) (← links)
- On reconstructing graphs from \(n - 2\) cards (Q2895327) (← links)
- A property of most of the known non-reconstructible digraphs (Q5074884) (← links)
- Size reconstructibility of graphs (Q6055396) (← links)
- Reconstructibility of the \(K_r\)-count from \(n - 1\) cards (Q6494931) (← links)