A new heuristic for detecting non-Hamiltonicity in cubic graphs (Q342098)

From MaRDI portal
Revision as of 13:30, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A new heuristic for detecting non-Hamiltonicity in cubic graphs
scientific article

    Statements

    A new heuristic for detecting non-Hamiltonicity in cubic graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    Hamiltonian cycles
    0 references
    linear feasibility
    0 references
    traveling salesman problem
    0 references
    polyhedra
    0 references
    0 references
    0 references
    0 references

    Identifiers