The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs (Q3947135)

From MaRDI portal
Revision as of 20:33, 14 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q438736)
scientific article
Language Label Description Also known as
English
The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs
scientific article

    Statements

    title
    The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs (English)
    0 references
    DOI
    10.1137/0211042
    0 references
    publication date
    1982
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C45
    0 references
    05C38
    0 references
    zbMATH DE Number
    3765161
    0 references
    zbMATH Keywords
    bridge, planted plane tree
    0 references
    NP-complete
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3947135&oldid=21227492"
    Powered by MediaWiki