( k)-half-reconstructible tournaments for k 6

DOI10.1016/J.CRMA.2008.07.024zbMATH Open1170.05030OpenAlexW1528651632MaRDI QIDQ950116FDOQ950116

Authors Youssef Boudabbous, Abderrahim Boussaïri, Abdelhak Chaïchaâ, Nadia El Amri 

Publication date 22 October 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.07.024

Mathematics Subject Classification ID

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

Recommendations

• Sur la (-k)-demi-reconstructibilité des tournois finis
• The \((\leq 6)\)-half-reconstructibility of digraphs
• Half-isomorphy, selfduality and finite non strongly connected tournaments
• Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
• scientific article; zbMATH DE number 6930600

Cites work

• scientific article; zbMATH DE number 458873 (Why is no real title available?)
• scientific article; zbMATH DE number 3334164 (Why is no real title available?)
• scientific article; zbMATH DE number 3375499 (Why is no real title available?)
• L'Indeformabilite des Relations et Multirelations Binaires
• La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
• La relation différence et l'anti‐isomorphie
• The \(C_{3}\)-structure of the tournaments.
• The minimal non-\((\leqslant k)\)-reconstructible relations
• Transitiv orientierbare Graphen

Cited in

(7)

• The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)
• Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
• Half-isomorphy, selfduality and finite non strongly connected tournaments
• The \((\leq 6)\)-half-reconstructibility of digraphs
• Hereditary hemimorphy of \(\{-k\}\)-hemimorphic tournaments for \(k \geq 5\)
• Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms
• Half-reconstruction of the operator transitive closure

This page was built for publication: \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\)

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