23 citations · 26 across the 6 of their papers we have counts for
8 papers
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…
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…
Infinitely many minimal classes of graphs of unbounded clique-width
A. Collins, J. Foniok, N. Korpelainen +2
The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely,…
The structure and the number of -free bipartite graphs
Vadim Lozin, Viktor Zamaraev
We show that the number of labelled -free bipartite graphs with vertices grows as . This resolves an open problem posed by Allen [P. Allen, Forbidden induced bip…
Dominating induced matchings in graphs containing no long claw
Alain Hertz, Vadim Lozin, Bernard Ries +2
An induced matching in a graph is dominating if every edge not in shares exactly one vertex with an edge in . The dominating induced matching problem (also known as…
Well-quasi-ordering does not imply bounded clique-width
Vadim Lozin, Igor Razgon, Viktor Zamaraev
We present a hereditary class of graphs of unbounded clique-width which is well-quasi-ordered by the induced subgraph relation. This result provides a negative answer to the questi…