4 citations · 18 across the 31 of their papers we have counts for
4 papers · 1 filter
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…
Understanding lettericity I: a structural hierarchy
Bogdan Alecu, Vadim Lozin
Lettericity is a graph parameter introduced by Petkovšek in 2002 in order to study well-quasi-orderability under the induced subgraph relation. In the world of permutations, geomet…
Combinatorics and algorithms for quasi-chain graphs
Bogdan Alecu, Aistis Atminas, Vadim Lozin +1
The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width…
Tree-width dichotomy
Vadim Lozin, Igor Razgon
We prove that the tree-width of graphs in a hereditary class defined by a finite set of forbidden induced subgraphs is bounded if and only if includes a complete graph, a c…