On the computational complexity of (O,P)-partition problems (Q4210668)

From MaRDI portal
scientific article; zbMATH DE number 1202461
Language Label Description Also known as
English
On the computational complexity of (O,P)-partition problems
scientific article; zbMATH DE number 1202461

    Statements

    On the computational complexity of (O,P)-partition problems (English)
    0 references
    0 references
    0 references
    8 November 1998
    0 references
    additive hereditary graph properties
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references