Closing Complexity Gaps for Coloring Problems on H-Free Graphs (Q4909517)

From MaRDI portal
Revision as of 11:00, 11 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6147787
Language Label Description Also known as
English
Closing Complexity Gaps for Coloring Problems on H-Free Graphs
scientific article; zbMATH DE number 6147787

    Statements

    Closing Complexity Gaps for Coloring Problems on H-Free Graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2013
    0 references
    0 references
    0 references
    0 references
    0 references