Crossing number is hard for cubic graphs (Q2496198)

From MaRDI portal
Revision as of 07:04, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jct/Hlineny06a, #quickstatements; #temporary_batch_1731475607626)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Crossing number is hard for cubic graphs
scientific article

    Statements

    title
    Crossing number is hard for cubic graphs (English)
    0 references
    author
    Petr Hliněný
    0 references
    publication date
    12 July 2006
    0 references
    zbMATH Keywords
    NP-completeness
    0 references

    Identifiers

    zbMATH DE Number
    5040275
    0 references
    Wikidata QID
    Q56032473
    0 references
    OpenAlex ID
    W2028446993
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2496198&oldid=37899146"
    Powered by MediaWiki