The degree sequence is reconstructible from \(n-1\) cards

DOI10.1016/0012-365X(92)90053-IzbMath0759.05065MaRDI QIDQ1193716

Wendy J. Myrvold

Publication date: 27 September 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

carddegree sequencevertex-deleted subgraph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

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

• Unnamed Item
• Unnamed Item
• Class-reconstruction of total graphs
• Graph reconstruction—a survey
• On reconstruction of graphs

This page was built for publication: The degree sequence is reconstructible from \(n-1\) cards