The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability

Carl Feghali, Hoang-Oanh Le, Van Bang Le

This paper continues the study of a new variant of graph coloring with a connectivity constraint recently introduced by Hsieh et al. [COCOON 2024]. A path in a vertex-colored graph…