Pages that link to "Item:Q3791182"

The following pages link to The reconstruction conjecture is true if all 2-connected graphs are reconstructible (Q3791182):

Displaying 13 items.

• The centroidal branches of a separable graph are edge reconstructible (Q1377714) (← links)
• Reconstruction of distance hereditary 2-connected graphs (Q1637150) (← links)
• The reconstruction conjecture for finite simple graphs and associated directed graphs (Q2138987) (← 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)
• A reduction of the graph reconstruction conjecture (Q2509541) (← links)
• Leaf-Reconstructibility of Phylogenetic Networks (Q4579954) (← links)
• (Q5000297) (← links)
• Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n−2 (Q5298353) (← links)
• On semi-reconstruction of graphs of connectivity 2 (Q6147865) (← links)
• Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs (Q6151923) (← links)
• Nonsplit Graphs with Split Maximal Induced Subgraphs (Q6154170) (← links)
• Reconstruction and edge reconstruction of triangle-free graphs (Q6184530) (← links)