ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Injective colorings of planar graphs with few colors [Elektronski vir]
    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.
    Source: Preprint series. - ISSN 1318-4865 (Vol. 44, št. 1022, 2006, str. 1-21)
    Type of material - e-article
    Publish date - 2006
    Language - english
    COBISS.SI-ID - 14787417