14 citations · 22 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019★ 3 cited
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…
cs.DM2019
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…