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 2026Show all

4 papers · 1 filter

cs.DS2026

Kempe Reachability with $k \geq 3$ Colors Is $PSPACE$ -Complete on Claw-Free Graphs

Duc A. Hoang

A \emph{proper vertex coloring} assigns colors to vertices so that adjacent vertices have distinct colors. A \emph{Kempe change} in a proper vertex coloring exchanges two colors on…

cs.DS2026

A Polynomial-Time Algorithm for $k$ -Path Vertex Cover Reconfiguration on Trees under Token Sliding

Duc A. Hoang

A $k$ -path vertex cover ( $k$ -PVC) of a graph is a set of vertices meeting every path on $k$ vertices. In Token Sliding, one token occupies each vertex of a cover; a move slides one…

math.CO2026

Token-sliding realizability for complements, Cartesian-products, and grid graph families

Duc A. Hoang

For an integer $k \geq 0$ and a graph $G$ , the \emph{token-sliding reconfiguration graph $TS_{k} (G)$ } has the independent $k$ -sets of $G$ as vertices. Two vertices are adjacen…

math.CO2026

On Realizing Reconfiguration Graphs of Cliques

Duc A. Hoang

For a graph $H$ and an integer $k \geq 1$ , the \emph{Token Sliding reconfiguration graph} $TS_{k} (H)$ and the \emph{Token Jumping reconfiguration graph} $TJ_{k} (H)$ hav…

Kempe Reachability with k≥3 Colors Is PSPACE-Complete on Claw-Free Graphs

A Polynomial-Time Algorithm for k-Path Vertex Cover Reconfiguration on Trees under Token Sliding

Token-sliding realizability for complements, Cartesian-products, and grid graph families

On Realizing Reconfiguration Graphs of Cliques

Kempe Reachability with $k \geq 3$ Colors Is $PSPACE$ -Complete on Claw-Free Graphs

A Polynomial-Time Algorithm for $k$ -Path Vertex Cover Reconfiguration on Trees under Token Sliding