The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 16:46, 5 March 2024
scientific article; zbMATH DE number 2139512
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
