The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867): 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.1080/00207160412331290685 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2034740402 / rank | |||
Normal rank |
Revision as of 01:41, 20 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