A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685)

From MaRDI portal
Revision as of 06:10, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
scientific article

    Statements

    A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (English)
    0 references
    0 references
    0 references
    0 references
    14 May 2020
    0 references
    uniquely hamiltonian graphs
    0 references
    integer linear programming
    0 references
    stable cycles
    0 references
    minimum counterexample
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references