Indecomposable tournaments and their indecomposable subtournaments on 5 vertices

DOI10.1016/J.CRMA.2006.10.029zbMath1107.05041arXiv1007.3049OpenAlexW2039466598MaRDI QIDQ858914

Imed Boudabbous, Houmem Belkhechine

Publication date: 11 January 2007

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.3049

zbMATH Keywords

critical tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Structure Theorem forU₅-free Tournaments ⋮ Subtournaments isomorphic to \(W_5\) in a indecomposable tournament

Cites Work

• Unnamed Item
• Primitivity is hereditary for 2-structures
• Indecomposable graphs
• Indecomposability and duality of tournaments
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Automorphism groups of designs
• Structure theorem for tournaments omitting N₅
• Transitiv orientierbare Graphen

This page was built for publication: Indecomposable tournaments and their indecomposable subtournaments on 5 vertices