The \(\{-2,-1\}\)-selfdual and decomposable tournaments
type: Item
instance of: scholarly article
title: The \(\{-2,-1\}\)-selfdual and decomposable tournaments
zbMATH Open document ID: 1391.05121
author: Youssef Boudabbous
author: P. Ille
publication date: 2018-06-29T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6897679
zbMATH Keywords: tournament
zbMATH Keywords: decomposable
zbMATH Keywords: selfdual
MaRDI profile type: Publication
full work available at URL: dmgt.2059
OpenAlex ID: W2794035839
cites work: The \(\{-3\}\)-reconstruction and the \(\{-3\}\)-self duality of tournaments.
cites work: Q3136258
cites work: Morphology of the \((-1)\)-critical tournaments
cites work: Graph reconstruction—a survey
cites work: Sur la répartition des diamants dans un tournoi. (On the repartition of diamonds in a tournament).
cites work: Q5310207
cites work: Indecomposability and duality of tournaments
cites work: Q4854730
cites work: Indecomposability graph and critical vertices of an indecomposable graph
cites work: Cut-primitive directed graphs versus clan-primitive directed graphs
cites work: The \(C_{3}\)-structure of the tournaments.
cites work: Q4954442
cites work: Q4492680
cites work: Self-Converse Tournaments
cites work: Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
cites work: Transitiv orientierbare Graphen
cites work: On the problem of reconstructing a tournament from subtournaments
cites work: Q3778787
cites work: Q4881848
cites work: Automorphism groups of designs
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: A translation of Gallai's paper: `Transitiv orientierbare Graphen'
cites work: Tournaments whose Subtournaments are Irreducible or Transitive
cites work: Q4081443
cites work: Strongly self-complementary and hereditarily isomorphic tournaments
cites work: Q5501210
cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
cites work: \(P_ 4\)-trees and substitution decomposition
cites work: Erratum to: “The falsity of the reconstruction conjecture for tournaments”
cites work: Q3259049
DOI: 10.7151/DMGT.2059
Recommended article: Indecomposability and duality of tournaments
Recommended article: The \((-1)\)-critically duo-free tournaments.
Recommended article: The \(\{-3\}\)-reconstruction and the \(\{-3\}\)-self duality of tournaments.
Recommended article: Q5294913
Recommended article: Sur la (-k)-demi-reconstructibilité des tournois finis
Recommended article: A note on decompositions of transitive tournaments
Recommended article: The \((-1)\)-critical tournaments
Recommended article: Transitive tournaments and self-complementary graphs
Recommended article: Half-isomorphy, selfduality and finite non strongly connected tournaments
Recommended article: Q4583890
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 6897679