VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Long cycles in fullerene graphs [Elektronski vir]
    Erman, Rok ; Kardoš, František ; Miškuf, Jozef
    It is conjectured that every fullerene graph is hamiltonian. Jendrol' and Owens proved [J. Math. Chem. 18 (1995), pp. 83-90] that every fullerene graph on ▫$n$▫ vertices has a cycle of length at ... least ▫$4n/5$▫. Recently, Kr\'{a}l' et al. improved it to ▫$5n/6 - 2/3$▫. In this paper, we study 2-factors of fullerene graphs. As a by-product, we get an improvement of a lower bound on the length of the longest cycle in a fullerene graph. We present a constructive proof of the bound ▫$6n/7 + 2/7$▫.
    Vir: Preprint series. - ISSN 1318-4865 (Vol. 46, št. 1055, 2008, str. 1-10)
    Vrsta gradiva - e-članek
    Leto - 2008
    Jezik - angleški
    COBISS.SI-ID - 14899033

    Povezava(-e):

    http://www.imfm.si/preprinti/PDF/01055.pdf

Vnos na polico