17 citations · 42 across the 15 of their papers we have counts for
3 papers · 1 filter
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…
Generalisations of Matrix Partitions : Complexity and Obstructions
Alexey Barsukov, Mamadou Moustapha Kanté
A trigraph is a graph where each pair of vertices is labelled either 0 (a non-arc), 1 (an arc) or (both an arc and a non-arc). In a series of papers, Hell and co-authors pr…
Letter graphs and geometric grid classes of permutations
Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté +3
We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both…