Duc A. Hoang

activity

20142026

most citedOn Reconfiguration Graphs of Independent Sets under Token Sliding

6 citations · 17 across the 13 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

cs.DS2022★ 1 cited

On the Complexity of Distance- $d$ Independent Set Reconfiguration

Duc A. Hoang

For a fixed positive integer $d \geq 2$ , a distance- $d$ independent set (D $d$ IS) of a graph is a vertex subset whose distance between any two members is at least $d$ . Imagine that…

math.CO2022★ 6 cited

On Reconfiguration Graphs of Independent Sets under Token Sliding

David Avis, Duc A. Hoang

An independent set of a graph $G$ is a vertex subset $I$ such that there is no edge joining any two vertices in $I$ . Imagine that a token is placed on each vertex of an independent…

cs.DS2022★ 1 cited

TS-Reconfiguration of $k$ -Path Vertex Covers in Caterpillars for $k \geq 4$

Duc A. Hoang

A $k$ -path vertex cover ( $k$ -PVC) of a graph $G$ is a vertex subset $I$ such that each path on $k$ vertices in $G$ contains at least one member of $I$ . Imagine that a token is plac…

On the Complexity of Distance-d Independent Set Reconfiguration

On Reconfiguration Graphs of Independent Sets under Token Sliding

TS-Reconfiguration of k-Path Vertex Covers in Caterpillars for k≥4

On the Complexity of Distance- $d$ Independent Set Reconfiguration

TS-Reconfiguration of $k$ -Path Vertex Covers in Caterpillars for $k \geq 4$