Abstract

List Coloring Under Some Graph Operations

Kinkar Ch, ra Das, Samane Bakaein, Mostafa Tavakoli, Freydoon Rahbarnia, Alireza Ashraf

The list coloring of a graph $G=G(V,E)$ is to color each vertex $v \in V(G)$ from its color set $L(v)$. If any two adjacent vertices have different colors, then $G$ is properly colored. The aim of this paper is to study the list coloring of some graph operations.