Recognizing connectedness from vertex-deleted subgraphs

DOI10.1002/jgt.20531zbMath1231.05156OpenAlexW2092362435MaRDI QIDQ5199418

No author found.

Publication date: 16 August 2011

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

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

zbMATH Keywords

cardreconstruction conjecturevertex-deleted subgraphreconstruction number

Mathematics Subject Classification ID

Connectivity (05C40) Vertex degrees (05C07)

Related Items (3)

Reconstructing the degree sequence of a sparse graph from a partial deck ⋮ The size of a graph is reconstructible from any \(n-2\) cards ⋮ Size reconstructibility of graphs

Cites Work

• Unnamed Item
• A congruence theorem for trees
• The reconstruction of maximal planar graphs. II: Reconstruction
• Families of pairs of graphs with a large number of common cards
• Graph reconstruction—a survey

This page was built for publication: Recognizing connectedness from vertex-deleted subgraphs