The degree sequence is reconstructible from \(n-1\) cards
From MaRDI portal
Publication:1193716
DOI10.1016/0012-365X(92)90053-IzbMath0759.05065MaRDI QIDQ1193716
Publication date: 27 September 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
A property of most of the known non-reconstructible digraphs ⋮ 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 ⋮ Families of pairs of graphs with a large number of common cards ⋮ Degree-associated reconstruction number of graphs ⋮ Towards size reconstruction from fewer cards
Cites Work
This page was built for publication: The degree sequence is reconstructible from \(n-1\) cards