J-coloring of graph operations
A vertex v of a given graph is said to be in a rainbow neighbourhood of G if every color class of G consists of at least one vertex from the closed neighbourhood N[v]. A maximal proper coloring of a graph G is a J-coloring if and only if every vertex of G belongs to a rainbow neighbourhood of G. In...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2019-08-01
|
| Series: | Acta Universitatis Sapientiae: Informatica |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/ausi-2019-0007 |