1 citations · 1 across the 5 of their papers we have counts for
8 papers · 1 filter
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…
Graph parameters, implicit representations and factorial properties
Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas +2
How to efficiently represent a graph in computer memory is a fundamental data structuring question. In the present paper, we address this question from a combinatorial point of vie…
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…
Critical properties of bipartite permutation graphs
Bogdan Alecu, Vadim Lozin, Dmitriy Malyshev
The class of bipartite permutation graphs enjoys many nice and important properties. In particular, this class is critically important in the study of clique- and rank-width of gra…
Graph classes with linear Ramsey numbers
Bogdan Alecu, Aistis Atminas, Vadim Lozin +1
The Ramsey number for a class of graphs is the minimum such that every graph in with at least vertices has either a clique of size or an independent…