DIKUL - logo
(UL)
  • Heuristic search for Hamilton cycles in cubic graphs
    Aleš, Janez, 1966- ; Mohar, Bojan, 1956- ; Pisanski, Tomaž
    A successful heuristic algorithm for finding Hamilton cycles in cubic graphs is described. Several graphs from The Foster census of connected symmetric trivalent graphs and all cubic Cayley graphs of ... the group PSL▫$_2(7)$▫ are shown to be hamiltonian.
    Source: Discrete mathematics. - ISSN 0012-365X (Vol. 307, iss. 3-5, 2007, str. 303-309)
    Type of material - article, component part
    Publish date - 2007
    Language - english
    COBISS.SI-ID - 14178393

source: Discrete mathematics. - ISSN 0012-365X (Vol. 307, iss. 3-5, 2007, str. 303-309)

loading ...
loading ...
loading ...