On the Complexity of Some Colorful Problems Parameterized by Treewidth (Q3611990)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the Complexity of Some Colorful Problems Parameterized by Treewidth
scientific article

    Statements

    On the Complexity of Some Colorful Problems Parameterized by Treewidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 March 2009
    0 references
    parameterized complexity
    0 references
    bounded treewidth
    0 references
    graph coloring
    0 references

    Identifiers

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