Pages that link to "Item:Q4632019"

The following pages link to Reconstruction from the deck of ‐vertex induced subgraphs (Q4632019):

Displaying 10 items.

• Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs (Q868330) (← 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)
• Set recognition of decomposable graphs and steps towards their reconstruction (Q2673544) (← links)
• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic (Q5863935) (← links)
• Reconstruction of the neighborhood deck of an ordered set (Q5929970) (← links)
• Size reconstructibility of graphs (Q6055396) (← links)
• 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs (Q6133663) (← links)
• Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs (Q6151923) (← links)