The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2139512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity for partitioning graphs by monochromatic trees, cycles and paths |
scientific article; zbMATH DE number 2139512 |
Statements
The complexity for partitioning graphs by monochromatic trees, cycles and paths (English)
0 references
28 February 2005
0 references
combinatorial problem
0 references
computational complexity
0 references
vertex disjoint
0 references
approximation algorithm
0 references
0.9470908
0 references
0.93257946
0 references
0 references
0.92647976
0 references
0.92434406
0 references
0.92383677
0 references
0.9155158
0 references
