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

DOI10.1007/s00373-016-1706-yzbMath1351.05095OpenAlexW2465743926MaRDI QIDQ343743

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

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

modular decomposition\(k\)-cycle partial digraphirreducible-module tournamentsreconstruction of tournaments

Mathematics Subject Classification ID

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

Related Items (1)

Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The pairs of \(\{-3\}\)-hypomorphic tournaments
• The half-isomorphy and the finite strongly connected tournaments
• \((-2)\)-monohemimorphic graphs
• Theory of 2-structures. I: Clans, basic subclasses, and morphisms
• The 2-reconstructible indecomposable graphs.
• Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
• Sur les graphes 2-reconstructibles (On the 2-reconstructible graphs)
• The \(C_{3}\)-structure of the tournaments.
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• The minimal non-\((\leqslant k)\)-reconstructible relations
• Half-isomorphy, selfduality and finite non strongly connected tournaments
• La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• \((\leq k)\)-reconstructible binary relations
• Hypomorphy of graphs up to complementation
• Boolean sum of graphs and reconstruction up to complementation
• HEREDITARY HEMIMORPHY OF {-κ}-HEMIMORPHIC TOURNAMENTS FOR ≥ 5
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey
• L'Indeformabilite des Relations et Multirelations Binaires
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
• Transitiv orientierbare Graphen
• Arc Mappings and Tournament Isomorphisms
• Modules of Coherent Binary Systems

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