Akademska digitalna zbirka SLovenije - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Injective colorings of planar graphs with few colors
    Lužar, Borut ; Škrekovski, Riste ; Tancer, Martin
    An injective coloring of a graph is a vertex coloring where two vertices have distinct colors if a path of length two exists between them. In this paper some results on injective colorings of planar ... graphs with few colors are presented. We show that all planar graphs of girth ▫$\ge 19$▫ and maximum degree ▫$\Delta$▫ are injectively ▫$\Delta$▫-colorable. We also show that all planar graphs of girth ▫$\ge 10$▫ are injectively ▫$(\Delta + 1)$▫-colorable, ▫$\Delta + 4$▫ colors are sufficient for planar graphs of girth ▫$\ge 5$▫ if ▫$\Delta$▫ is large enough, and that subcubic planar graphs of girth ▫$\ge 7$▫ are injectively 5-colorable.
    Vir: Combinatorics 2006, A Meeting in Celebration of Pavol Hell's 60th Birthday (May 1-5, 2006) : special issue (Str. 5636-5649)
    Vrsta gradiva - prispevek na konferenci
    Leto - 2009
    Jezik - angleški
    COBISS.SI-ID - 15281497

    Povezava(-e):

    http://dx.doi.org/10.1016/j.disc.2008.04.005

Vnos na polico