Choosability on \(H\)-free graphs (Q1943624)

From MaRDI portal
Revision as of 06:15, 12 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Choosability on \(H\)-free graphs
scientific article

    Statements

    title
    Choosability on \(H\)-free graphs (English)
    0 references
    author
    Pinar Heggernes
    0 references
    Pim van 't Hof
    0 references
    Daniël Paulusma
    0 references
    Petr A. Golovach
    0 references
    publication date
    20 March 2013
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    choosability
    0 references
    H-free graphs
    0 references
    linear forest
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    05C15
    0 references
    zbMATH DE Number
    6147220
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1943624&oldid=20770005"
    Powered by MediaWiki