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

Carl Feghali, Hoàng-Oanh Le, Van Bang Le. The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability. Discrete Applied Mathematics, 383:85-93, 2026. [doi]

Abstract

Abstract is missing.