Pages that link to "Item:Q3553230"

The following pages link to Families of pairs of graphs with a large number of common cards (Q3553230):

Displayed 6 items.

• Lexicographic products with high reconstruction numbers (Q418863) ‎ (← links)
• The adversary degree-associated reconstruction number of double-brooms (Q491632) ‎ (← 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)
• Recognizing connectedness from vertex-deleted subgraphs (Q5199418) ‎ (← links)
• Size reconstructibility of graphs (Q6055396) ‎ (← links)