Determining the thickness of graphs is NP-hard (Q3969882)

From MaRDI portal
Revision as of 08:26, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Determining the thickness of graphs is NP-hard
scientific article

    Statements

    title
    Determining the thickness of graphs is NP-hard (English)
    0 references
    author
    Anthony Mansfield
    0 references
    publication date
    1983
    0 references
    zbMATH Keywords
    nonplanarity
    0 references
    printed circuits
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C10
    0 references
    zbMATH DE Number
    3793424
    0 references
    Wikidata QID
    Q56689316
    0 references
    OpenAlex ID
    W2047095042
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3969882&oldid=36879835"
    Powered by MediaWiki