Indecomposability and duality of tournaments
DOI10.1016/S0012-365X(00)00040-6zbMATH Open0968.05036OpenAlexW2111789324WikidataQ126438081 ScholiaQ126438081MaRDI QIDQ1587596FDOQ1587596
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
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
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)
Cited In (20)
- Title not available (Why is that?)
- Autonomous parts and decomposition of regular tournaments
- Decomposability index of tournaments
- Irreducible pairings and indecomposable tournaments
- The morphology of infinite tournaments; application to the growth of their profile
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments
- Indecomposable tournaments and their indecomposable subtournaments on 5 vertices
- Finite tournaments with a nonempty diamonds' support
- Prime orders all of whose prime suborders are selfdual
- Tournaments without acyclic interval.
- Making a tournament indecomposable by one subtournament-reversal operation
- Configurations inévitables dans un tournoi indécomposable
- The operad of finite labeled tournaments
- Graphic topology on tournaments
- On the functional completeness of simple tournaments
- Indecomposable tournaments and their indecomposable subtournaments with six vertices
- The \((-1)\)-critically duo-free tournaments.
- Title not available (Why is that?)
- Half-isomorphy, selfduality and finite non strongly connected tournaments
- Bounds on the disparity and separation of tournament solutions
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)
