9 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Université Clermont AuvergneFR10 papers
- Institut National Polytechnique de ToulouseFR8 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR6 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Institut PascalFR4 papers
- Azienda Ospedaliera Ospedale MaggioreIT2 papers
- Czech Technical University in PragueCZ2 papers
- Laboratoire Plasma et Conversion d'EnergieFR2 papers
- University of MilanIT2 papers
- Centre de Biologie Intégrative de ToulouseFR1 paper
- Centre de Nanosciences et de NanotechnologiesFR1 paper
- Centre de Recherche d'Albi en génie des Procédés, des SOlides Divisés, de l'Énergie et de l'EnvironnementFR1 paper
Showing math.COShow all
2 papers · 1 filter
math.CO2024★ 1 cited
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim Lozin +1
Lettericity is a graph parameter responsible for many attractive structural properties. In particular, graphs of bounded lettericity have bounded linear clique-width and they are w…
math.CO2021★ 3 cited
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
Mamadou Mostapha Kanté, Eun Jung Kim, O-joung Kwon +1
Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. How…