The Hamiltonian circuit problem for circle graphs is NP-complete (Q1823687)

From MaRDI portal
Revision as of 09:45, 20 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Hamiltonian circuit problem for circle graphs is NP-complete
scientific article

    Statements

    title
    The Hamiltonian circuit problem for circle graphs is NP-complete (English)
    0 references
    author
    Peter Damaschke
    0 references
    publication date
    1989
    0 references
    zbMATH Keywords
    Hamiltonian circuit
    0 references
    circle graphs
    0 references
    NP-completeness
    0 references

    Identifiers

    zbMATH DE Number
    4115967
    0 references
    OpenAlex ID
    W2052982152
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1823687&oldid=34809847"
    Powered by MediaWiki