Reconstructibility of the \(K_r\)-count from \(n - 1\) cards

DOI10.1016/J.DISC.2024.113950MaRDI QIDQ6494931

Charlotte Knierim, Anders Martinsson

Publication date: 30 April 2024

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

zbMATH Keywords

vertex-deleted subgraphsgraph reconstructionclique count

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A congruence theorem for trees
• The degree sequence is reconstructible from \(n-1\) cards
• Reconstructing the degree sequence of a sparse graph from a partial deck
• The reconstruction of outerplanar graphs
• The size of a graph is reconstructible from any \(n-2\) cards
• Almost every graph has reconstruction number three
• Recognizing connectedness from vertex-deleted subgraphs
• Size reconstructibility of graphs

This page was built for publication: Reconstructibility of the \(K_r\)-count from \(n - 1\) cards