Y. Manoussakis

collaborators

2 papers

math.CO2018

On the number of vertex-disjoint cycles in digraphs

Yandong Bai, Yannis Manoussakis

Let $k$ be a positive integer. Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least $2 k - 1$ contains $k$ vertex-disjoint cycles. It is famous…

cs.DS2016

The complexity of tropical graph homomorphisms

Florent Foucaud, Ararat Harutyunyan, Pavol Hell +3

A tropical graph $(H, c)$ consists of a graph $H$ and a (not necessarily proper) vertex-colouring $c$ of $H$ . Given two tropical graphs $(G, c_{1})$ and $(H, c)$ , a homomorphism of $(G,…