On the structural parameterized complexity of defective coloring

In this paper, we consider the problem Defective Coloring. Given a graph G and two positive integers k and Δ⁎, the objective is to determine whether it is possible to obtain a coloring (not necessarily proper) of the vertices of G using at most k colors such that each vertex has at most Δ⁎ neighbors...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 157; p. 103736
Main Authors:	Bhyravarapu, Sriram, Kumar, Pankaj, Saurabh, Saket
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.05.2026
Subjects:	Bounded degree graphs Defective coloring Neighborhood diversity Parameterized complexity Split graphs Twin-cover Twin-cover Split graphs Neighborhood diversity Defective coloring Parameterized complexity Bounded degree graphs
ISSN:	0022-0000
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!