Indecomposability and duality of tournaments

DOI10.1016/S0012-365X(00)00040-6MaRDI QIDQ1587596zbMATH OpenOpenAlexWikidataFDO

Authors Youssef Boudabbous, Jamel Dammak, P. Ille

Publication date 10 May 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00040-6

zbMATH Keywords

indecomposable subtournamentsreconstructionself-dualtournament

Mathematics Subject Classification ID

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

Review text

The authors say that a tournament \(T\) with \(n\) vertices is indecomposable if its vertex set cannot be partitioned into \(k\) subsets, where \(2\leq k\leq n-1\), in such a way that all of the arcs between any pair of subsets have the same orientation. They characterize tournaments \(T\) with the property that every proper subtournament of \(T\) that is indecomposable is also self-dual. They also consider the problem of reconstructing tournaments from their proper indecomposable subtournaments.

Recommendations

• Recognizing indecomposability for tournaments
• Tournaments with maximal decomposability
• Decomposability and co-modular indices of tournaments
• Configurations inévitables dans un tournoi indécomposable
• Decomposability index of tournaments
• Dichotomy for finite tournaments of mixed-type
• The \(\{-2,-1\}\)-selfdual and decomposable tournaments
• scientific article; zbMATH DE number 817353
• scientific article; zbMATH DE number 2170421
• A note on decompositions of transitive tournaments

Cited in

(21)

• On the functional completeness of simple tournaments
• The \(\{-2,-1\}\)-selfdual and decomposable tournaments
• Graphic topology on tournaments
• Half-isomorphy, selfduality and finite non strongly connected tournaments
• Making a tournament indecomposable by one subtournament-reversal operation
• Bounds on the disparity and separation of tournament solutions
• Decomposability index of tournaments
• Indecomposable tournaments and their indecomposable subtournaments with six vertices
• Tournaments without acyclic interval.
• Finite tournaments with a nonempty diamonds' support
• The \((-1)\)-critically duo-free tournaments.
• scientific article; zbMATH DE number 1823770 (Why is no real title available?)
• Configurations inévitables dans un tournoi indécomposable
• scientific article; zbMATH DE number 817353 (Why is no real title available?)
• Prime orders all of whose prime suborders are selfdual
• Irreducible pairings and indecomposable tournaments
• Autonomous parts and decomposition of regular tournaments
• Prime and critical digraphs
• The operad of finite labeled tournaments
• Indecomposable tournaments and their indecomposable subtournaments on 5 vertices
• The morphology of infinite tournaments; application to the growth of their profile

This page was built for publication: Indecomposability and duality of tournaments

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