Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications (Q2144878)

From MaRDI portal
Revision as of 06:49, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
scientific article

    Statements

    Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 June 2022
    0 references
    graph
    0 references
    Hamiltonian path
    0 references
    Hamiltonian cycle
    0 references
    Hamilton-connected graph
    0 references
    detour index
    0 references
    NP-complete problems
    0 references
    Platonic solids
    0 references
    convex polytopes
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references