Coloring graphs characterized by a forbidden subgraph (Q476308)

From MaRDI portal
Revision as of 02:23, 9 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)
scientific article
Language Label Description Also known as
English
Coloring graphs characterized by a forbidden subgraph
scientific article

    Statements

    title
    Coloring graphs characterized by a forbidden subgraph (English)
    0 references
    author
    Petr A. Golovach
    0 references
    Daniël Paulusma
    0 references
    Bernard Ries
    0 references
    publication date
    28 November 2014
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    algorithms
    0 references
    graph coloring
    0 references
    forbidden subgraphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C15
    0 references
    05C60
    0 references
    05C85
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6375311
    0 references
    OpenAlex ID
    W2026189561
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q476308&oldid=38122476"
    Powered by MediaWiki