The minimal non-\((\leqslant k)\)-reconstructible relations

DOI10.1016/j.disc.2004.08.016zbMath1059.05053MaRDI QIDQ1772265

Gérard Lopez, Youssef Boudabbous

Publication date: 18 April 2005

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

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

zbMATH Keywords

duality; reconstruction; indecomposability; binary relations

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

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

Related Items

Unnamed Item, Unnamed Item, Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic, Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\), The \((\leq 6)\)-half-reconstructibility of digraphs, Prechains and self duality, \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\), The 2-reconstructible indecomposable graphs., Finite orders which are reconstructible up to duality by their comparability graphs, \((\leq k)\)-reconstructible binary relations

Cites Work

• Theory of relations. Transl. from the French by P. Clote
• La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
• L'Indeformabilite des Relations et Multirelations Binaires
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• La relation différence et l'anti‐isomorphie
• Transitiv orientierbare Graphen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item