L(2,1)-colorings and irreducible no-hole colorings of the direct product of graphs

An L(2,1)-coloring (or labeling) of a graph G is a mapping f:V(G)→Z+⋃{0} such that |f(u)−f(v)|≥2 for all edges uv of G, and |f(u)−f(v)|≥1 if u and v are at distance two in G. The span of anL(2,1)-coloring is the maximum color (or label) assigned by it. The span of a graphG, denoted by λ(G), is equal...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2020-06, Vol.280, p.186-200
Hauptverfasser:	Mandal, Nibedita, Panigrahi, Pratima
Format:	Artikel
Sprache:	eng
Schlagworte:	[formula omitted]-coloring Apexes Color Coloring Direct product of graphs Graph theory Graphs Irreducible coloring No-hole coloring Span of a graph Upper bounds Vertex sets
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!