ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • 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: Preprint series. - ISSN 1318-4865 (Let. 28, št. 324, 1990, str. 1-6)
    Type of material - article, component part
    Publish date - 1990
    Language - english
    COBISS.SI-ID - 59647744

source: Preprint series. - ISSN 1318-4865 (Let. 28, št. 324, 1990, str. 1-6)
loading ...
loading ...
loading ...