<abstract xmlns="http://www.w3.org/1999/xhtml"><p>A vertex v of a given graph G is said to be in a rainbow neighbourhood of G, with respect to a proper coloring C of G, if the closed neighbourhood N[v] of the vertex v consists of at least one vertex from every color class of G with respect to C. A maximal proper coloring of a graph G is a J-coloring of G such that every vertex of G belongs to a rainbow neighbourhood of G. In this paper, we study certain parameters related to J-coloring of certain Mycielski-type graphs.</p></abstract>

A vertex v of a given graph G is said to be in a rainbow neighbourhood of G, with respect to a proper coloring C of G, if the closed neighbourhood N[v] of the vertex v consists of at least one vertex from every color class of G with respect to C. A maximal proper coloring of a graph G is a J-coloring of G such that every vertex of G belongs to a rainbow neighbourhood of G. In this paper, we study certain parameters related to J-coloring of certain Mycielski-type graphs.

On J-colorability of certain derived graph classes

Universidade Federal de Pernambuco Recife

Acta Universitatis Sapientiae, Informatica

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"On J-colorability of certain derived graph classes"}

A vertex v of a given graph G is said to be in a rainbow neighbourhood of G, with respect to a proper coloring C of G, if the closed neighbourhood N[v] of the...

On J-colorability of certain derived graph classes

Online veröffentlicht: 21. Jan. 2020

Seitenbereich: 159 - 173

Eingereicht: 22. Okt. 2019

DOI: https://doi.org/10.2478/ausi-2019-0011

Schlüsselwörter
Mycielski graphs, graph coloring, rainbow neighbourhoods, J-coloring of graphs

© 2019 Federico Fornasiero et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

On J-colorability of certain derived graph classes

Online veröffentlicht: 21. Jan. 2020

Seitenbereich: 159 - 173

Eingereicht: 22. Okt. 2019

DOI: https://doi.org/10.2478/ausi-2019-0011

SchlüsselwörterMycielski graphs, graph coloring, rainbow neighbourhoods, J-coloring of graphs

© 2019 Federico Fornasiero et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Schlüsselwörter
Mycielski graphs, graph coloring, rainbow neighbourhoods, J-coloring of graphs