5 citations · 5 across the 2 of their papers we have counts for
5 papers
Complementary cycles of any length in regular bipartite tournaments
Stéphane Bessy, Jocelyn Thiebaut
Let be a -regular bipartite tournament on vertices. We show that, for every with , has a cycle of length such that is…
Avoidable paths in graphs
Marthe Bonamy, Oscar Defrain, Meike Hatzel +1
We prove a recent conjecture of Beisegel et al. that for every positive integer k, every graph containing an induced P_k also contains an avoidable P_k. Avoidability generalises th…
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-p…
(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity
Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut
Given a tournament , the problem MaxCT consists of finding a maximum (arc-disjoint) cycle packing of . In the same way, MaxTT corresponds to the specific case where the colle…
Triangle packing in (sparse) tournaments: approximation and kernelization
Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut
Given a tournament T and a positive integer k, the C_3-Pakcing-T problem asks if there exists a least k (vertex-)disjoint directed 3-cycles in T. This is the dual problem in tourna…