Some results on the b-chromatic number in complementary prism graphs

Autor:	Noureddine Ikhlef-Eschouf, Mostafa Blidia, Amel Bendali-Braham
Rok vydání:	2019
Předmět:	Combinatorics Vertex (graph theory) B-coloring ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Chromatic scale Management Science and Operations Research Graph ComputingMethodologies_COMPUTERGRAPHICS Computer Science Applications Theoretical Computer Science Mathematics
Zdroj:	RAIRO - Operations Research. 53:1187-1195
ISSN:	1290-3868 0399-0559
Popis:	A b-coloring of a graph G is a proper coloring of G with k colors such that each color class has a vertex that is adjacent to at least one vertex of every other color classes. The b-chromatic number is the largest integer k for which G has a b-coloring with k colors. In this paper, we present some results on b-coloring in complementary prism graphs.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::5343ad3becd4b4043525fcda05b59703 https://doi.org/10.1051/ro/2018054 Zobrazit plný text záznamu