Injective colorings of planar graphs with few colors

Popis výsledku

—

Jazyk výsledku
angličtina
Název v původním jazyce
Injective colorings of planar graphs with few colors
Popis výsledku v původním jazyce
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 allplanar graphs of girth at least 19 and maximum degree Delta are injectively Delta-colorable. We also show that all planar graphs of girth at leas 10 are injectively (Delta 1)-colorable, Delta 4 colors are sufficient for planar graphs of girth at least 5 if Delta is large enough, and that subcubic graphs of girth at least 7 are injectively 5-colorable.
Název v anglickém jazyce
Injective colorings of planar graphs with few colors
Popis výsledku anglicky
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 allplanar graphs of girth at least 19 and maximum degree Delta are injectively Delta-colorable. We also show that all planar graphs of girth at leas 10 are injectively (Delta 1)-colorable, Delta 4 colors are sufficient for planar graphs of girth at least 5 if Delta is large enough, and that subcubic graphs of girth at least 7 are injectively 5-colorable.

Projekt
1M0545: Institut Teoretické Informatiky
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění
2009
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Druh výsledku

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

J_x

CEP

BA - Obecná matematika

Rok uplatnění

2009