The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)

DOI10.1016/j.crma.2008.04.012zbMath1146.05037OpenAlexW2495528249MaRDI QIDQ935344

Nadia El Amri

Publication date: 6 August 2008

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2008.04.012

Mathematics Subject Classification ID

Other classical set theory (including functions, relations, and set algebra) (03E20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Unnamed Item

Cites Work

• L'Indeformabilite des Relations et Multirelations Binaires
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)