Decomposability index of tournaments

DOI10.1016/j.disc.2017.07.016zbMath1370.05076OpenAlexW2747110467MaRDI QIDQ2404390

Houmem Belkhechine

Publication date: 18 September 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2017.07.016

zbMATH Keywords

inversiontournamentindecomposablemoduledecomposability index

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Tournaments with maximal decomposability ⋮ Decomposability and co-modular indices of tournaments ⋮ Prime orientable graphs ⋮ Making a tournament indecomposable by one subtournament-reversal operation ⋮ Editing to prime graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kernels for feedback arc set in tournaments
• Primitivity is hereditary for 2-structures
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Inversions in tournaments
• \(P_ 4\)-trees and substitution decomposition
• 2-partition-transitive tournaments
• Indecomposable graphs
• Automorphisms and enumeration of switching classes of tournaments
• An extremal connectivity parameter of tournaments
• The reversing number of a digraph
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Doubly regular tournaments are equivalent to skew Hadamard matrices
• Some remarks on simple tournaments
• On strongly homogeneous tournaments
• A reversal index for tournament matrices^*
• Ranking Tournaments

This page was built for publication: Decomposability index of tournaments