The traveling salesman problem in graphs with 3-edge cutsets (Q3773723)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The traveling salesman problem in graphs with 3-edge cutsets
scientific article

    Statements

    The traveling salesman problem in graphs with 3-edge cutsets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph decompositions
    0 references
    integer polytopes
    0 references
    decomposition properties of a graph
    0 references
    polynomial solution
    0 references
    traveling salesman problem
    0 references
    3-edge cutset
    0 references
    polynomial algorithm
    0 references
    Halin graphs
    0 references
    prismatic graphs
    0 references
    0 references
    0 references