Akademska digitalna zbirka SLovenije - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Strong parity vertex coloring of plane graphs [Elektronski vir]
    Kaiser, Tomáš ...
    Czap and Jendrol' introduced the notions of strong parity vertex coloring and the corresponding strong parity chromatic number ▫$\xi_s$▫. They conjectured that there is a constant bound ▫$K$▫ on ... ▫$\xi_s$▫ for the class of ▫$2$▫-connected plane graphs. We prove that the conjecture is true with ▫$K=97$▫, even with an added restriction to proper colorings. Next, we provide simple examples showing that the sharp bound is at least 8, or at least 10 for proper strong parity vertex colorings.
    Vir: Preprint series [Elektronski vir]. - ISSN 2232-2094 (Vol. 49, št. 1144, 2011, str. 1-14)
    Vrsta gradiva - e-članek
    Leto - 2011
    Jezik - angleški
    COBISS.SI-ID - 15841625

    Povezava(-e):

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

Vnos na polico