On reconstructing graphs from n - 2 cards

zbMATH Open1242.05184MaRDI QIDQ2895327FDOQ2895327

William Kocay

Publication date: 2 July 2012

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cited In (1)

• The size of a graph is reconstructible from any \(n-2\) cards

This page was built for publication: On reconstructing graphs from \(n - 2\) cards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895327)