27 citations · 28 across the 9 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.CC2024
The complexity of strong conflict-free vertex-connection -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…
cs.DM2024
Complexity of the (Connected) Cluster Vertex Deletion problem on -free graphs
Hoang-Oanh Le, Van Bang Le
The well-known Cluster Vertex Deletion problem (CVD) asks for a given graph and an integer whether it is possible to delete a set of at most vertices of such th…