On R-hued Coloring of Some Perfect and Circulant Graphs

On R-hued Coloring of Some Perfect and Circulant Graphs

A r-hued k-coloring of a graph G is a proper coloring with k colors such that for every vertex v with degree d(v) in G, the neighbors of v must be colored by at least min{d(v),r} different colors. The r-hued chromatic number, Xr (G), of G is the minimum k for which G has a r-hued k-coloring. In this...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IAENG international journal of applied mathematics 2019-11, Vol.49 (4), p.1-6
Hauptverfasser: Yang, Chenxu, Deng, Xingchao, Shao, Ruifang
Format: Artikel
Sprache:eng
Schlagworte:
Coloring
Graphs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A r-hued k-coloring of a graph G is a proper coloring with k colors such that for every vertex v with degree d(v) in G, the neighbors of v must be colored by at least min{d(v),r} different colors. The r-hued chromatic number, Xr (G), of G is the minimum k for which G has a r-hued k-coloring. In this paper, we study the r-hued coloring of some perfect and circulant graphs.
ISSN:1992-9978
1992-9986