On semi-reconstruction of graphs of connectivity 2

DOI10.1007/s10958-023-06669-7OpenAlexW4387221594MaRDI QIDQ6147865

Dmitriy V. Karpov

Publication date: 1 February 2024

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-023-06669-7

zbMATH Keywords

2-connected graphgraph reconstruction conjecture

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• The decomposition tree of a biconnected graph
• Minimal biconnected graphs
• On the structure of a \(k\)-connected graph
• Large contractible subgraphs of a 3-connected graph
• On Ulam's conjecture for separable graphs
• Blocks in \(k\)-connected graphs
• Decomposition of a 2-connected graph into three connected subgraphs
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible

This page was built for publication: On semi-reconstruction of graphs of connectivity 2