24 citations · 100 across the 34 of their papers we have counts for
4 papers · 1 filter
Blow-ups and extensions of trees in tournaments
Pierre Aboulker, Frédéric Havet, William Lochet +3
A class of acyclic digraphs is linearly unavoidable if there exists a constant such that every digraph is contained in all tournaments of order…
Computing the degreewidth of a digraph is hard
Pierre Aboulker, Nacim Oijid, Robin Petit +2
Given a digraph, an ordering of its vertices defines a backedge graph, namely the undirected graph whose edges correspond to the arcs pointing backwards with respect to the order.…
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
Pierre Aboulker, Frédéric Havet, François Pirot +1
Let be a digraph. Its acyclic number is the maximum order of an acyclic induced subdigraph and its dichromatic number is the least integer such that $…
Finding forest-orderings of tournaments is NP-complete
Pierre Aboulker, Guillaume Aubian, Raul Lopes
Given a class of (undirected) graphs , we say that a Feedback Arc Set (FAS for short) is a -FAS if the graph induced by the edges of (forgetting t…