25Some New Graph Coloring Problems

Sudev Naduvath

Department of Mathematics,CHRIST (Deemed to be University),Bengaluru, Karnataka (INDIA)E-mail: sudevnk@gmail.com

Johan Kok

City of Tshwane,South AfricaE-mail: jacotype@gmail.com

Graph coloring is an assignment of colors, labels, or weights to the elements of a given graph G. A color class of G is a set of its vertices having the same color. A rainbow neighbourhood in a graph G is the closed neighbourhood of a vertex which consists of at least a vertex from every color class. In this chapter, we discuss some new types of graph coloring based on the rainbow neighbourhoods in the graph concerned and related results.

25.1Introduction

In this chapter, we discuss some new graph coloring protocols, ...

Get Recent Advancements in Graph Theory now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.