The complexity of planar graph choosability (Q1126188)

From MaRDI portal
Revision as of 15:00, 11 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: reviewed by (P1447): Item:Q228790)
scientific article
Language Label Description Also known as
English
The complexity of planar graph choosability
scientific article

    Statements

    title
    The complexity of planar graph choosability (English)
    0 references
    author
    Shai Gutner
    0 references
    publication date
    18 June 1997
    0 references
    review text
    Margit Voigt gave examples of a planar graph which is not 4-choosable and a planar triangle-free graph which is not 3-choosable. The present author presents simpler examples. He also proves that the corresponding decision problems for planar graphs are NP-hard.
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C15
    0 references
    68R10
    0 references
    zbMATH DE Number
    955087
    0 references
    zbMATH Keywords
    choosability
    0 references
    planar graph
    0 references
    decision problems
    0 references
    NP-hard
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1126188&oldid=20641280"
    Powered by MediaWiki