Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
type: Item
instance of: scholarly article
title: Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
zbMATH Open document ID: 1351.05095
author: Rim Ben Hamadou
author: Youssef Boudabbous
author: Nadia El Amri
author: Gérard Lopez
published in: Graphs and Combinatorics
publication date: 2016-11-29T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6657152
zbMATH Keywords: reconstruction of tournaments
zbMATH Keywords: \(k\)-cycle partial digraph
zbMATH Keywords: irreducible-module tournaments
zbMATH Keywords: modular decomposition
MaRDI profile type: Publication
full work available at URL: s00373-016-1706-y
OpenAlex ID: W2465743926
cites work: The pairs of \(\{-3\}\)-hypomorphic tournaments
cites work: Q4583735
cites work: Q3872493
cites work: Modules of Coherent Binary Systems
cites work: Q3975132
cites work: Graph reconstruction—a survey
cites work: The half-isomorphy and the finite strongly connected tournaments
cites work: Half-isomorphy, selfduality and finite non strongly connected tournaments
cites work: HEREDITARY HEMIMORPHY OF {-κ}-HEMIMORPHIC TOURNAMENTS FOR ≥ 5
cites work: La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
cites work: \((\leq k)\)-reconstructible binary relations
cites work: The minimal non-\((\leqslant k)\)-reconstructible relations
cites work: \((-2)\)-monohemimorphic graphs
cites work: Sur les graphes 2-reconstructibles (On the 2-reconstructible graphs)
cites work: The 2-reconstructible indecomposable graphs.
cites work: The \(C_{3}\)-structure of the tournaments.
cites work: Hypomorphy of graphs up to complementation
cites work: Boolean sum of graphs and reconstruction up to complementation
cites work: Theory of 2-structures. I: Clans, basic subclasses, and morphisms
cites work: Q4492680
cites work: Q3070210
cites work: Q5611770
cites work: Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
cites work: Q4000222
cites work: Transitiv orientierbare Graphen
cites work: Arc Mappings and Tournament Isomorphisms
cites work: Q3142912
cites work: Q5661500
cites work: Q5646907
cites work: L'Indeformabilite des Relations et Multirelations Binaires
cites work: RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
cites work: Q5585195
cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
cites work: The falsity of the reconstruction conjecture for tournaments
cites work: Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
cites work: Q3259049
DOI: 10.1007/S00373-016-1706-Y
description: scientific article; zbMATH DE number 6657152