Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: total colouring

Sortuj według:

Ogranicz wyniki do:

[r, s, t]-colourings of paths

Salvador Villa M., Schiermeyer I.

Opuscula Mathematica

2007

Vol. 27, no. 1

131-149

The concept of [r, s, t]-colourings was recently introduced by Hackmann, Kemnitz and Marangio [3] as follows: Given non-negative integers r, s and t, an [r, s, t]-colouring of a graph G = (V(G), E(G)) is a mapping c from V(G) ∪ E(G) to the colour set {1, 2,..., k} such that ‌c(vi) - c(vj)‌ ≥ r for every two adjacent vertices vi, vj, ‌c(ei) - c(ej)‌ ≥ s for every two adjacent edges ei, ej, and ‌c(vi) - c(ej)‌ ≥ t for all pairs of incident vertices and edges, respectively. The [r, s, t]-chromatic number Xr,s,t(G) of G is defined to be the minimum k such that G admits an [r, s, t]-colouring. In this paper, we determine the [r, s, t]-chromatic number for paths.