Pages that link to "Item:Q2171022"
From MaRDI portal
The following pages link to Reconstructing the degree sequence of a sparse graph from a partial deck (Q2171022):
Displaying 5 items.
- The degree sequence is reconstructible from \(n-1\) cards (Q1193716) (← links)
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (Q2175784) (← links)
- Reconstruction from the deck of ‐vertex induced subgraphs (Q4632019) (← links)
- Size reconstructibility of graphs (Q6055396) (← links)
- Reconstructibility of the \(K_r\)-count from \(n - 1\) cards (Q6494931) (← links)