Dynamic coloring on restricted graph classes

DOI10.1016/J.TCS.2025.115260MaRDI QIDQ6985822zbMATH OpenFDO

Authors Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

Publication date 12 May 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

NP-completenessclique-widthfixed-parameter tractabilitybipartite graphsdynamic coloringneighborhood diversityproper coloringtwin-cover

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Dynamic coloring on restricted graph classes

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