Pages that link to "Item:Q1201271"
From MaRDI portal
The following pages link to Finite undirected graphs which are not reconstructible from their large cardinality subgraphs (Q1201271):
Displaying 8 items.
- Largest non-unique subgraphs (Q882786) (← links)
- Reconstructing the degree sequence of a sparse graph from a partial deck (Q2171022) (← 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)
- The size of a graph is reconstructible from any \(n-2\) cards (Q2411612) (← links)
- (Q3374778) (← links)
- (Q4027185) (← links)
- 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs (Q6133663) (← links)