The reconstruction conjecture is true if all 2-connected graphs are reconstructible

DOI10.1002/jgt.3190120214zbMath0647.05041OpenAlexW2030934523WikidataQ123331256 ScholiaQ123331256MaRDI QIDQ3791182

Yang Yongzhi

Publication date: 1988

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190120214

zbMATH Keywords

reconstruction conjecturefinite graphs2-connected graphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (13)

The reconstruction conjecture for finite simple graphs and associated directed graphs ⋮ Reconstruction of distance hereditary 2-connected graphs ⋮ Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n−2 ⋮ The centroidal branches of a separable graph are edge reconstructible ⋮ Leaf-Reconstructibility of Phylogenetic Networks ⋮ Unnamed Item ⋮ On semi-reconstruction of graphs of connectivity 2 ⋮ Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs ⋮ Nonsplit Graphs with Split Maximal Induced Subgraphs ⋮ Reconstruction and edge reconstruction of triangle-free graphs ⋮ Reconstruction number of graphs with unique pendant vertex ⋮ Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible ⋮ A reduction of the graph reconstruction conjecture

Cites Work

• A congruence theorem for trees
• On Ulam's conjecture for separable graphs

This page was built for publication: The reconstruction conjecture is true if all 2-connected graphs are reconstructible