The complexity of strong conflict-free vertex-connection $k$-colorability

Sun-Yuan Hsieh, Hoang-Oanh Le, Van Bang Le +1

We study a new variant of graph coloring by adding a connectivity constraint. A path in a vertex-colored graph is called conflict-free if there is a color that appears exactly once…