Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs (Q2301740): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-25005-8_12 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2917964206 / rank | |||
Normal rank | |||
Latest revision as of 20:07, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs |
scientific article |
Statements
Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs (English)
0 references
25 February 2020
0 references
Colorful Component
0 references
caterpillar
0 references
binary tree
0 references
planar subcubic graph
0 references
