No Detail Found!

On the [r; s; t]-coloring of the square of cylindrical grids

Author(s)
Brice Effantin Laboratoire d'InfoRmatique en Image et Syste`mes d'information UMR 5205, Ecole Centrale de Lyon,Universite ́ Lyon 2, F-69622 Villeurbanne,France
Abstract
The [r; s; t]-coloring is a generalization of the classical vertex, edge, and total colorings, where two vertices, two edges, and a vertex and its incident edges have colors distant by at least r, s, and t, respectively. The square of a graph G is a graph obtained from G by adding an edge between two vertices at a distance at most 2 in G. A cylindrical grid is equivalent to the Cartesian product of a path and a cycle. In this article, colorings for the square of cylindrical grids are discussed. It is shown that such graphs are class one graphs (according to Vizing's theorem). For the [r; s; t]-coloring of these graphs, particular values of r, s, and t are presented, for which the minimum number of colors needed in an [r; s; t]-coloring is determined.
Publication Details
Page(s) 15-22
Published Journal: Discrete Mathematics Letters, Volume: 15, Issue: 0, Year: 2025

Request the full text from PASTIC

Keywords
edge coloring, total coloring, Cartesian product, vertex coloring
References
. .0(mod 5). , : .
. .4r (by Theorem 1. , : .
. .. 2t then Corollary 4, : .
. .1)s + 1; t + 1g = ( 0([Pn. , : .
. .1)s + 1. , : .
. .Then we define the two sets of colors Sv = ft; s+t; 2s+t; 3s+t; 4s+tg and Se = f0; s; 2s; : : : ; ksg.. , : .
0

Citations

0

Downloads

62

Views