Computing complete graph isomorphisms and Hamiltonian cycles from partial ones (Q1597764)

From MaRDI portal
Revision as of 10:28, 12 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
scientific article

    Statements

    Computing complete graph isomorphisms and Hamiltonian cycles from partial ones (English)
    0 references
    30 May 2002
    0 references
    0 references
    Hamiltonian cycles
    0 references
    0 references
    0 references
    0 references