Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs (Q2301740)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Towards a complexity dichotomy for colourful components problems on k-caterpillars and small-degree planar graphs |
scientific article; zbMATH DE number 7173527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs |
scientific article; zbMATH DE number 7173527 |
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
0.9769524931907654
0 references
0.8612348437309265
0 references
0.7949843406677246
0 references
0.7792049050331116
0 references
Q747623 (Deleted Item)
0.776185154914856
0 references
