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

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 157; s. 103736
Hlavní autori:	Bhyravarapu, Sriram, Kumar, Pankaj, Saurabh, Saket
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.05.2026
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!