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