Pages that link to "Item:Q5199418"
From MaRDI portal
The following pages link to Recognizing connectedness from vertex-deleted subgraphs (Q5199418):
Displaying 4 items.
- 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)
- Size reconstructibility of graphs (Q6055396) (← links)
- Reconstructibility of the \(K_r\)-count from \(n - 1\) cards (Q6494931) (← links)