Towards size reconstruction from fewer cards

DOI10.1016/j.disc.2015.06.015zbMath1318.05046OpenAlexW836796476MaRDI QIDQ2515598

Douglas R. Woodall

Publication date: 5 August 2015

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

Full work available at URL: https://doi.org/10.1016/j.disc.2015.06.015

zbMATH Keywords

cardvertex-deleted subgraphsize reconstruction

Mathematics Subject Classification ID

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

Related Items (3)

A property of most of the known non-reconstructible digraphs ⋮ The size of a graph is reconstructible from any \(n-2\) cards ⋮ Size reconstructibility of graphs

Cites Work

• The degree sequence is reconstructible from \(n-1\) cards
• Graph reconstruction—a survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards size reconstruction from fewer cards