Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs

DOI10.1007/978-3-030-25005-8_12OpenAlexW2917964206MaRDI QIDQ2301740

Janka Chlebíková, Clément Dallard

Publication date: 25 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-25005-8_12

zbMATH Keywords

binary treecaterpillarplanar subcubic graphColorful Component

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items

Colourful components in \(k\)-caterpillars and planar graphs, Finding a Small Number of Colourful Components