LIST COLORING UNDER SOME GRAPH OPERATIONS

Kinkar Chandra Das, Samane Bakaein, Mostafa Tavakoli, Freydoon Rahbarnia, Alireza Ashrafi

Research output: Contribution to journalArticlepeer-review

Abstract

The list coloring of a graph G = G(V,E) is to color each vertex v ∈ V (G) from its color set L(v). If any two adjacent vertices have different colors, then G is properly colored.

Original languageEnglish
Pages (from-to)417-431
Number of pages15
JournalKragujevac Journal of Mathematics
Volume46
Issue number3
DOIs
StatePublished - 2022

Keywords

  • Coloring
  • Graph operation
  • List coloring

Cite this