A. Atminas

activity

20162021

collaborators

5 papers

math.CO2021

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…

math.CO2019

Graph classes with linear Ramsey numbers

Bogdan Alecu, Aistis Atminas, Vadim Lozin +1

The Ramsey number $R_{X} (p, q)$ for a class of graphs $X$ is the minimum $n$ such that every graph in $X$ with at least $n$ vertices has either a clique of size $p$ or an independent…

math.CO2018

Graph functionality

Bogdan Alecu, Aistis Atminas, Vadim Lozin

Let $G = (V, E)$ be a graph and $A$ its adjacency matrix. We say that a vertex $y \in V$ is a function of vertices $x_{1}, \dots, x_{k} \in V$ if there exists a Boolean function $f$ of $…

math.CO2017

Classes of graphs without star forests and related graphs

Aistis Atminas

This work provides a structural characterisation of hereditary graph classes that do not contain a star forest, several graphs obtained from star forests by subset complementation,…

math.CO2016

On forbidden induced subgraphs for unit disk graphs

Aistis Atminas, Viktor Zamaraev

A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of m…