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