On semi-reconstruction of graphs of connectivity 2
type: Item
instance of: scholarly article
title: On semi-reconstruction of graphs of connectivity 2
author: D. V. Karpov
published in: Journal of Mathematical Sciences (New York)
publication date: 2024-02-01T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7798384
zbMATH Keywords: graph reconstruction conjecture
zbMATH Keywords: 2-connected graph
MaRDI profile type: MaRDI publication profile
full work available at URL: s10958-023-06669-7
OpenAlex ID: W4387221594
cites work: A congruence theorem for trees
cites work: Q3259049
cites work: Q5524326
cites work: On Ulam's conjecture for separable graphs
cites work: The reconstruction conjecture is true if all 2-connected graphs are reconstructible
cites work: On the structure of a \(k\)-connected graph
cites work: Blocks in \(k\)-connected graphs
cites work: The decomposition tree of a biconnected graph
cites work: Minimal biconnected graphs
cites work: Decomposition of a 2-connected graph into three connected subgraphs
cites work: Large contractible subgraphs of a 3-connected graph
DOI: 10.1007/S10958-023-06669-7
Recommended article: Reconstruction from the deck of \(k\)-vertex induced subgraphs
Recommended article: Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
Recommended article: Size reconstructibility of graphs
Recommended article: Reconstructing the degree sequence of a sparse graph from a partial deck
Recommended article: Reconstructing graphs from a deck of all distinct cards
description: scientific article; zbMATH DE number 7798384