Pages that link to "Item:Q908942"
From MaRDI portal
The following pages link to Reconstructing degree sequences from k-vertex-deleted subgraphs (Q908942):
Displaying 9 items.
- Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs (Q868330) (← links)
- Reconstructing graphs from their k-edge deleted subgraphs (Q1077434) (← links)
- The degree sequence is reconstructible from \(n-1\) cards (Q1193716) (← links)
- On the reconstruction of the degree sequence (Q1861223) (← links)
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (Q2175784) (← links)
- 3-regular graphs are 2-reconstructible (Q2225421) (← links)
- (Q3089201) (← links)
- Convexity of degree sequences (Q4229268) (← links)
- On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices (Q5001714) (← links)