The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867)

From MaRDI portal
Revision as of 01:41, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problem
    0 references
    computational complexity
    0 references
    vertex disjoint
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references