Description of the tournaments which are reconstructible from their k-cycle partial digraphs for k \3, 4\

DOI10.1007/S00373-016-1706-YMaRDI QIDQ343743zbMATH OpenOpenAlexFDO

Authors Rim Ben Hamadou, Youssef Boudabbous, Nadia El Amri, Gérard Lopez

Publication date 29 November 2016

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-016-1706-y

zbMATH Keywords

\(k\)-cycle partial digraphirreducible-module tournamentsmodular decompositionreconstruction of tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• ( k)-half-reconstructible tournaments for k 6
• Sur la (-k)-demi-reconstructibilité des tournois finis
• scientific article; zbMATH DE number 969976
• scientific article; zbMATH DE number 4039950
• scientific article; zbMATH DE number 817353

Cites work

• \((-2)\)-monohemimorphic graphs
• \((\leq k)\)-reconstructible binary relations
• Arc Mappings and Tournament Isomorphisms
• Boolean sum of graphs and reconstruction up to complementation
• Constructing families of highly similar but non-isomorphic tournaments
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Graph reconstruction—a survey
• Half-isomorphy, selfduality and finite non strongly connected tournaments
• Hereditary hemimorphy of \(\{-k\}\)-hemimorphic tournaments for \(k \geq 5\)
• scientific article; zbMATH DE number 458873 (Why is no real title available?)
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3675933 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 50583 (Why is no real title available?)
• scientific article; zbMATH DE number 1478125 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (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?)
• scientific article; zbMATH DE number 3394133 (Why is no real title available?)
• Hypomorphy of graphs up to complementation
• 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)
• Modules of Coherent Binary Systems
• Orders and ( 4)-hemimorphy
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
• Sur les graphes 2-reconstructibles (On the 2-reconstructible graphs)
• The 2-reconstructible indecomposable graphs.
• The \(C_{3}\)-structure of the tournaments.
• The falsity of the reconstruction conjecture for tournaments
• The half-isomorphy and the finite strongly connected tournaments
• The minimal non-( k)-reconstructible relations
• The pairs of \(\{-3\}\)-hypomorphic tournaments
• Theory of 2-structures. I: Clans, basic subclasses, and morphisms
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• Transitiv orientierbare Graphen
• Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs

Cited in

(4)

• scientific article; zbMATH DE number 4214046 (Why is no real title available?)
• scientific article; zbMATH DE number 4039950 (Why is no real title available?)
• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
• ( k)-half-reconstructible tournaments for k 6

This page was built for publication: Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)

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