Dynamic coloring on restricted graph classes

A proper k-coloring of a graph is an assignment of colors from the set {1,2,…,k} to the vertices of the graph such that no two adjacent vertices receive the same color. Given a graph G and an integer k, the Dynamic Coloring problem asks whether there exists a proper k-coloring of G such that for eve...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 1043; p. 115260
Main Authors:	Bhyravarapu, Sriram, Kumari, Swati, Reddy, I. Vinod
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 30.07.2025
Subjects:	Bipartite graphs Clique-width Dynamic coloring Fixed-parameter tractable Neighborhood diversity NP-complete Proper coloring Twin-cover Dynamic coloring Twin-cover Proper coloring Neighborhood diversity NP-complete Fixed-parameter tractable Bipartite graphs Clique-width
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!