Indecomposability and duality of tournaments

DOI10.1016/S0012-365X(00)00040-6zbMath0968.05036OpenAlexW2111789324WikidataQ126438081 ScholiaQ126438081MaRDI QIDQ1587596

Pierre Ille, Jamel Dammak, Youssef Boudabbous

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

tournamentreconstructionself-dualindecomposable subtournaments

Mathematics Subject Classification ID

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

Related Items (9)

The \(\{-2,-1\}\)-selfdual and decomposable tournaments ⋮ Indecomposable tournaments and their indecomposable subtournaments on 5 vertices ⋮ Prime orders all of whose prime suborders are selfdual ⋮ The morphology of infinite tournaments; application to the growth of their profile ⋮ Graphic topology on tournaments ⋮ The operad of finite labeled tournaments ⋮ Indecomposable tournaments and their indecomposable subtournaments with six vertices ⋮ Tournaments without acyclic interval. ⋮ Half-isomorphy, selfduality and finite non strongly connected tournaments

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