21 citations · 42 across the 14 of their papers we have counts for
3 papers · 1 filter
Digraph redicolouring
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse +2
Given two -dicolourings of a digraph , we prove that it is PSPACE-complete to decide whether we can transform one into the other by recolouring one vertex at each step while…
Preferential attachment hypergraph with vertex deactivation
Frédéric Giroire, Nicolas Nisse, Kostiantyn Ohulchanskyi +2
In the field of complex networks, hypergraph models have so far received significantly less attention than graphs. However, many real-life networks feature multiary relations (co-a…
Cop and robber games when the robber can hide and ride
Jérémie Chalopin, Victor Chepoi, Nicolas Nisse +1
In the classical cop and robber game, two players, the cop C and the robber R, move alternatively along edges of a finite graph G. The cop captures the robber if both players are o…