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

DOI10.1007/978-3-030-25005-8_12MaRDI QIDQ2301740zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Colourful components in \(k\)-caterpillars and planar graphs
• Finding a small number of colourful components
• The Proper Interval Colored Graph problem for caterpillar trees
• On the parameterized complexity of colorful components and related problems

Cited in

(2)

• Finding a small number of colourful components
• Colourful components in \(k\)-caterpillars and planar graphs

This page was built for publication: Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301740)