Pages that link to "Item:Q1637150"

The following pages link to Reconstruction of distance hereditary 2-connected graphs (Q1637150):

Displaying 8 items.

• Reconstruction of a graph from 2-vicinities of its vertices (Q947081) (← links)
• Reconstruction number of graphs with unique pendant vertex (Q2235292) (← links)
• Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible (Q2283214) (← links)
• Reconstruction of bipartite graphs and triangle-free graphs with connectivity two (Q2906851) (← links)
• (Q5000297) (← 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)
• Nonsplit Graphs with Split Maximal Induced Subgraphs (Q6154170) (← links)