Pages that link to "Item:Q2515598"
From MaRDI portal
The following pages link to Towards size reconstruction from fewer cards (Q2515598):
Displaying 8 items.
- The degree sequence is reconstructible from \(n-1\) cards (Q1193716) (← links)
- Finite undirected graphs which are not reconstructible from their large cardinality subgraphs (Q1201271) (← links)
- A new approach to graph reconstruction using supercards (Q1691216) (← links)
- The size of a graph is reconstructible from any \(n-2\) cards (Q2411612) (← links)
- On pairs of graphs having \(n-2\) cards in common. (Q2828914) (← links)
- On reconstructing graphs from \(n - 2\) cards (Q2895327) (← links)
- A property of most of the known non-reconstructible digraphs (Q5074884) (← links)
- Size reconstructibility of graphs (Q6055396) (← links)