Y. Manoussakis

activity

20142018

most citedThe complexity of tropical graph homomorphisms

11 citations · 14 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2018★ 1 cited

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…

math.CO2014

Partitioning a graph into highly connected subgraphs

Valentin Borozan, Michael Ferrara, Shinya Fujita +4

Given $k \geq 1$ , a $k$ -proper partition of a graph $G$ is a partition $P$ of $V (G)$ such that each part $P$ of $P$ induces a $k$ -connected subgraph of $G$ . We…