TY - JOUR
ID - 14463
TI - On Equitable Near Proper Coloring of Graphs
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Jose, Sabitha
AU - Samuel, Libin Chacko
AU - Naduvath, Sudev
AD - Department of Mathematics, CHRIST (Deemed to be University), Bangalore-560029, Karnataka,
India
Y1 - 2024
PY - 2024
VL - 9
IS - 1
SP - 131
EP - 143
KW - Improper coloring
KW - equitable coloring
KW - near proper coloring
KW - equitable near proper coloring
DO - 10.22049/cco.2022.27240.1218
N2 - A defective vertex coloring of a graph is a coloring in which some adjacent vertices may have the same color. An edge whose adjacent vertices have the same color is called a bad edge. A defective coloring of a graph $G$ with minimum possible number of bad edges in $G$ is known as a near proper coloring of $G$. In this paper, we introduce the notion of equitable near proper coloring of graphs and determine the minimum number of bad edges obtained from an equitable near proper coloring of some graph classes.
UR - https://comb-opt.azaruniv.ac.ir/article_14463.html
L1 - https://comb-opt.azaruniv.ac.ir/article_14463_aa03f3848854de27fc92f8e02e499257.pdf
ER -