67 citations · 377 across the 34 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019
Subexponential-time algorithms for finding large induced sparse subgraphs
Jana Novotná, Karolina Okrasa, Michał Pilipczuk +3
Let and be hereditary graph classes. Consider the following problem: given a graph , find a largest, in terms of the number of vertices…
math.CO2019★ 25 cited
Planar graphs have bounded nonrepetitive chromatic number
Vida Dujmović, Louis Esperet, Gwenaël Joret +2
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the se…