Pages that link to "Item:Q3553230"
From MaRDI portal
The following pages link to Families of pairs of graphs with a large number of common cards (Q3553230):
Displaying 11 items.
- Lexicographic products with high reconstruction numbers (Q418863) (← links)
- The adversary degree-associated reconstruction number of double-brooms (Q491632) (← links)
- Graphs with a common eigenvalue deck (Q957997) (← links)
- A new approach to graph reconstruction using supercards (Q1691216) (← 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)
- On pairs of graphs having \(n-2\) cards in common. (Q2828914) (← links)
- On reconstructing graphs from \(n - 2\) cards (Q2895327) (← links)
- Recognizing connectedness from vertex-deleted subgraphs (Q5199418) (← links)
- Size reconstructibility of graphs (Q6055396) (← links)