LIST COLORING UNDER SOME GRAPH OPERATIONS

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

doi:10.46793/KgJMat2203.417D

LIST COLORING UNDER SOME GRAPH OPERATIONS

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

Department of Mathematics

Ferdowsi University of Mashhad
University of Kashan

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	417-431
Number of pages	15
Journal	Kragujevac Journal of Mathematics
Volume	46
Issue number	3
DOIs	https://doi.org/10.46793/KgJMat2203.417D
State	Published - 2022

Keywords

Coloring
Graph operation
List coloring

Access to Document

10.46793/KgJMat2203.417D

Cite this

@article{c29dd960ca70489cb8f99736b311cbaf,

title = "LIST COLORING UNDER SOME GRAPH OPERATIONS",

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.",

keywords = "Coloring, Graph operation, List coloring",

author = "Das, \{Kinkar Chandra\} and Samane Bakaein and Mostafa Tavakoli and Freydoon Rahbarnia and Alireza Ashrafi",

year = "2022",

doi = "10.46793/KgJMat2203.417D",

language = "English",

volume = "46",

pages = "417--431",

journal = "Kragujevac Journal of Mathematics",

issn = "1450-9628",

publisher = "University of Kragujevac, Faculty of Science",

number = "3",

}

TY - JOUR

T1 - LIST COLORING UNDER SOME GRAPH OPERATIONS

AU - Das, Kinkar Chandra

AU - Bakaein, Samane

AU - Tavakoli, Mostafa

AU - Rahbarnia, Freydoon

AU - Ashrafi, Alireza

PY - 2022

Y1 - 2022

N2 - 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.

AB - 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.

KW - Coloring

KW - Graph operation

KW - List coloring

UR - https://www.scopus.com/pages/publications/85131422007

U2 - 10.46793/KgJMat2203.417D

DO - 10.46793/KgJMat2203.417D

M3 - Article

AN - SCOPUS:85131422007

SN - 1450-9628

VL - 46

SP - 417

EP - 431

JO - Kragujevac Journal of Mathematics

JF - Kragujevac Journal of Mathematics

IS - 3

ER -

LIST COLORING UNDER SOME GRAPH OPERATIONS

Abstract

Keywords

Access to Document

Other files and links

Cite this