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

From MaRDI portal
Revision as of 18:52, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    30 May 2002
    0 references
    0 references
    Hamiltonian cycles
    0 references