Hanchun Yuan

activity

20202025

most citedPolynomial Kernels for Paw-free Edge Modification Problems

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2025

The Minimum Number of Edges in $(p + 1) K_{2}$ -Saturated Graphs

Xiaoteng Zhou, Kazuya Haraguchi, Hanchun Yuan

Given a family of graphs $F$ , a graph $G$ is $F$ -saturated if it is $F$ -free but the addition of any missing edge creates a copy of some $F \in \mathc…

cs.DS2022

Modification Problems toward Proper (Helly) Circular-arc Graphs

Yixin Cao, Jianxin Wang, Hanchun Yuan

We present a $9^{k} \cdot n^{O (1)}$ -time algorithm for the proper circular-arc vertex deletion problem, resolving an open problem of van 't Hof and Villanger [Algorithmica 2013] and C…

cs.DS2020★ 1 cited

Polynomial Kernels for Paw-free Edge Modification Problems

Yixin Cao, Yuping Ke, Hanchun Yuan

Let $H$ be a fixed graph. Given a graph $G$ and an integer $k$ , the $H$ -free edge modification problem asks whether it is possible to modify at most $k$ edges in $G$ to make it $H$ …

The Minimum Number of Edges in (p+1)K2​-Saturated Graphs

Modification Problems toward Proper (Helly) Circular-arc Graphs

Polynomial Kernels for Paw-free Edge Modification Problems

The Minimum Number of Edges in $(p + 1) K_{2}$ -Saturated Graphs