14 citations · 22 across the 4 of their papers we have counts for
4 papers
On girth and the parameterized complexity of token sliding and token jumping
Valentin Bartier, Nicolas Bousquet, Clément Dallard +2
In the Token Jumping problem we are given a graph and two independent sets and of , each of size . The goal is to determine whether there exists a…
Proportionally dense subgraph of maximum size: complexity and approximation
Cristina Bazgan, Janka Chlebíková, Clément Dallard +1
We define a proportionally dense subgraph (PDS) as an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in th…
Colourful components in -caterpillars and planar graphs
Janka Chlebíková, Clément Dallard
A connected component of a vertex-coloured graph is said to be colourful if all its vertices have different colours. By extension, a graph is colourful if all its connected compone…
Graphs without a partition into two proportionally dense subgraphs
Cristina Bazgan, Janka Chlebíková, Clément Dallard
A \emph{proportionally dense subgraph} (PDS) is an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the s…