Pages that link to "Item:Q2935256"

The following pages link to On Reconstructing Graphs and Their Complements (Q2935256):

Displaying 16 items.

• The \((\leq 6)\)-half-reconstructibility of digraphs (Q404400) (← links)
• Reconstructing graphs from cut-set sizes (Q909677) (← links)
• On \({\mathcal C}K_ 1\)-reconstruction of a pair of graphs (Q909679) (← links)
• Triangulating remnants of complete graphs (Q1087891) (← links)
• Combinatorial reconstruction problems (Q1095932) (← links)
• A conjecture on the reconstruction of graphs from metric balls of their vertices (Q2470472) (← links)
• Rebuilding convex sets in graphs (Q2566140) (← links)
• On the reconstruction of planar graphs (Q2642012) (← links)
• Set recognition of decomposable graphs and steps towards their reconstruction (Q2673544) (← links)
• The \((\leq k)\)-half-reconstructability of graphs for \(7\leq k\leq 12\). (Q2828847) (← links)
• On the complexity of reconstructing H-free graphs from their Star Systems (Q3174240) (← links)
• Reconstructing Digraphs from Partial Dadecks (Q3439067) (← links)
• (Q3504736) (← links)
• (Q3765814) (← links)
• (Q4316714) (← links)
• On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices (Q5001714) (← links)