The \(C_{3}\)-structure of the tournaments.

DOI10.1016/S0012-365X(03)00244-9zbMath1037.05024OpenAlexW2166330451MaRDI QIDQ1426106

Gérard Lopez, Pierre Ille, Abderrahim Boussaïri, Steéphan Thomassé

Publication date: 14 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00244-9

zbMATH Keywords

interval inversion

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

The \(\{-2,-1\}\)-selfdual and decomposable tournaments ⋮ The idiosyncratic polynomial of digraphs ⋮ Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) ⋮ The pairs of \(\{-3\}\)-hypomorphic tournaments ⋮ \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\) ⋮ Finite orders which are reconstructible up to duality by their comparability graphs ⋮ Cut-primitive directed graphs versus clan-primitive directed graphs ⋮ Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments ⋮ Skew-symmetric matrices and their principal minors ⋮ Prime 3-uniform hypergraphs ⋮ The recognition of the class of indecomposable digraphs under low hemimorphy ⋮ Critical 3-hypergraphs ⋮ Generalized tournament matrices with the same principal minors ⋮ 3-uniform hypergraphs: modular decomposition and realization by tournaments

Cites Work

• Primitivity is hereditary for 2-structures
• \(P_ 4\)-trees and substitution decomposition
• Indecomposable graphs
• Minimal indecomposable graphs
• L'Indeformabilite des Relations et Multirelations Binaires
• Transitiv orientierbare Graphen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(C_{3}\)-structure of the tournaments.