Irreducible pairings and indecomposable tournaments
From MaRDI portal
Publication:6580491
DOI10.1007/S00373-024-02803-7zbMATH Open1544.05044MaRDI QIDQ6580491FDOQ6580491
Authors: Houmem Belkhechine, Cherifa Ben Salha, Rim Romdhane
Publication date: 29 July 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Partitions of sets (05A18) Transversal (matching) theory (05D15) Total orders (06A05)
Cites Work
- Graphs indecomposable with respect to the X-join
- Free cumulants and enumeration of connected partitions
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Proportions of Irreducible Diagrams
- Embedding tournaments in simple tournaments
- Some remarks on simple tournaments
- Indecomposable graphs
- Contribution a L'etude Du Probleme Des Timbres Poste
- Sur Un Problème De Configurations Et Sur Les Fractions Continues
- Primitivity is hereditary for 2-structures
- The asymptotic number of irreducible partitions
- On a class of linked diagrams. I: Enumeration
- Title not available (Why is that?)
- A Fast Algorithm for the Decomposition of Graphs and Posets
- On a class of linked diagrams. II: Asymptotics
- The enumeration of connected graphs and linked diagrams
- Tournaments with maximal decomposability
- Simple one‐point extensions of tournaments
- Proportions of Irreducible Diagrams
- An Algorithm for the Modular Decomposition of Hypergraphs
- The enumeration of irreducible combinatorial objects
- Decomposability index of tournaments
- Decomposability and co-modular indices of tournaments
- Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices
This page was built for publication: Irreducible pairings and indecomposable tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580491)