The \((\leq 6)\)-half-reconstructibility of digraphs

DOI10.1016/j.crma.2014.03.009zbMath1297.05164arXiv1311.1765OpenAlexW2022065036MaRDI QIDQ404400

Baraa Salem, Jamel Dammak

Publication date: 4 September 2014

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

Full work available at URL: https://arxiv.org/abs/1311.1765

zbMATH Keywords

oriented graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Prechains and self duality
• \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\)
• The minimal non-\((\leqslant k)\)-reconstructible relations
• La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
• Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
• HEREDITARY HEMIMORPHY OF {-κ}-HEMIMORPHIC TOURNAMENTS FOR ≥ 5
• Graph reconstruction—a survey
• Sur la (-k)-demi-reconstructibilité des tournois finis
• La dualité dans la demi-reconstruction des relations binaires finies
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
• La relation différence et l'anti‐isomorphie
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \((\leq 6)\)-half-reconstructibility of digraphs