On equitable near-proper coloring of some derived graph classes
An equitable near-proper coloring of a graph $G$ is a defective coloring in which the number of vertices in any two color classes differ by at most one and the bad edges obtained is minimized by restricting the number of color classes that can have adjacency among their own elements. This paper inve...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vasyl Stefanyk Precarpathian National University
2022-12-01
|
| Series: | Karpatsʹkì Matematičnì Publìkacìï |
| Subjects: | |
| Online Access: | https://journals.pnu.edu.ua/index.php/cmp/article/view/5226 |