The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver (Q2327525)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver
scientific article

    Statements

    The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver (English)
    0 references
    0 references
    0 references
    15 October 2019
    0 references
    graph theory
    0 references
    complete graphs
    0 references
    Eulerian circuits
    0 references
    shortest subcycles
    0 references
    computer experiments
    0 references

    Identifiers