Akademska digitalna zbirka SLovenije - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Counting Hamiltonian cycles in 2-tiled graphs [Elektronski vir]
    Vegi Kalamar, Alen ; Žerak, Tadej, 1993- ; Bokal, Drago, 1978-
    In 1930, Kuratowski showed that 3,3 and 5 are the only two minor-minimal nonplanar graphs. Robertson and Seymour extended finiteness of the set of forbidden minors for any surface. Širáň and Kochol ... showed that there are infinitely many k-crossing-critical graphs for any ≥2, even if restricted to simple 3-connected graphs. Recently, 2-crossing-critical graphs have been completely characterized by Bokal, Oporowski, Richter, and Salazar. We present a simplified description of large 2-crossing-critical graphs and use this simplification to count Hamiltonian cycles in such graphs. We generalize this approach to an algorithm counting Hamiltonian cycles in all 2-tiled graphs, thus extending the results of Bodroža-Pantić, Kwong, Doroslovački, and Pantić.
    Vir: Mathematics [Elektronski vir]. - ISSN 2227-7390 (Vol. 9, iss. 6, 2021, str. 1-27)
    Vrsta gradiva - e-članek ; neleposlovje za odrasle
    Leto - 2021
    Jezik - angleški
    COBISS.SI-ID - 61574403

    Povezava(-e):

    Digitalna knjižnica Univerze v Mariboru – DKUM

Vnos na polico