Pages that link to "Item:Q1193716"

The following pages link to The degree sequence is reconstructible from \(n-1\) cards (Q1193716):

Displaying 8 items.

• Degree-associated reconstruction number of graphs (Q709303) (← links)
• 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)
• Towards size reconstruction from fewer cards (Q2515598) (← links)
• Families of pairs of graphs with a large number of common cards (Q3553230) (← 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)