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

From MaRDI portal
Revision as of 19:10, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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