VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Planar graphs have exponentially many 3-arboricities
    Harutyunyan, Ararat, 1984- ; Mohar, Bojan, 1956-
    It is well known that every planar or projective planar graph can be 3-colored so that each color class induces a forest. This bound is sharp. In this paper, we show that there are in fact ... exponentially many 3-colorings of this kind for any (projective) planar graph. The same result holds in the setting of 3-list-colorings.
    Vir: SIAM journal on discrete mathematics. - ISSN 0895-4801 (Vol. 26, no. 3, 2012, str. 1269-1280)
    Vrsta gradiva - članek, sestavni del
    Leto - 2012
    Jezik - angleški
    COBISS.SI-ID - 16552025