1 citations · 2 across the 8 of their papers we have counts for
3 papers · 1 filter
On the Complexity of Vertex-Splitting Into an Interval Graph
Faisal N. Abu-Khzam, Dipayan Chakraborty, Lucas Isenmann +1
Vertex splitting is a graph modification operation in which a vertex is replaced by multiple vertices such that the union of their neighborhoods equals the neighborhood of the orig…
Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter
Faisal N. Abu-Khzam, Lucas Isenmann
The s-club cluster vertex deletion number of a graph, or sccvd, is the minimum number of vertices whose deletion results in a disjoint union of s-clubs, or graphs whose diameter is…
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-p…