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

From MaRDI portal
Revision as of 00:01, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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