On semi-reconstruction of graphs of connectivity 2

DOI10.1007/S10958-023-06669-7MaRDI QIDQ6147865zbMATH OpenOpenAlexFDO

Authors D. 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)

Recommendations

• Reconstruction from the deck of k-vertex induced subgraphs
• Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
• Size reconstructibility of graphs
• Reconstructing the degree sequence of a sparse graph from a partial deck
• Reconstructing graphs from a deck of all distinct cards

Cites work

• A congruence theorem for trees
• Blocks in \(k\)-connected graphs
• Decomposition of a 2-connected graph into three connected subgraphs
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• Large contractible subgraphs of a 3-connected graph
• Minimal biconnected graphs
• On the structure of a k-connected graph
• On Ulam's conjecture for separable graphs
• The decomposition tree of a biconnected graph
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147865)