On the structural parameterized complexity of defective coloring

DOI10.1016/J.JCSS.2025.103736MaRDI QIDQ6859744zbMATH OpenFDO

Authors Sriram Bhyravarapu, Pankaj Kumar, Saket Saurabh

Publication date 11 February 2026

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

parameterized complexitysplit graphsneighborhood diversitybounded-degree graphsdefective coloringtwin-cover

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: On the structural parameterized complexity of defective coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859744)