15 citations · 57 across the 24 of their papers we have counts for
4 papers · 1 filter
List coloring digraphs
Julien Bensmail, Ararat Harutyunyan, Ngoc Khang Le
The dichromatic number of a digraph is the least number such that the vertex set of can be partitioned into parts each of which induces an acyclic subdig…
Disjoint cycles of different lengths in graphs and digraphs
Julien Bensmail, Ararat Harutyunyan, Ngoc Khang Le +2
Understanding how the cycles of a graph or digraph behave in general has always been an important point of graph theory. In this paper, we study the question of finding a set of $k…
Disproving the normal graph conjecture
Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé
A graph is called normal if there exist two coverings, and of its vertex set such that every member of induces a clique in , every mem…
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le +1
The Barát-Thomassen conjecture asserts that there is a function such that for every fixed tree with edges, every graph which is -edge-connected with its number of…