Hong Chang

activity

20162026

most citedNordhaus-Gaddum-type theorem for conflict-free connection number of graphs

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

collaborators

Showing math.GTShow all

3 papers · 1 filter

math.GT2026

Minimal Filling $K$ -Systems of Curves

Hong Chang, Xiao Chen, Wujie Shen

In this paper, we determine the exact minimal number of curves in a filling $k$ -system on an oriented surface of genus $g$ for any positive integers $k$ and $g$ .

math.GT2026

Twisted torus links that are unlinks

Hong Chang, Thiago de Paiva, Qing Lan

A twisted torus link $T (p, q, r, s)$ is obtained by performing $s$ full twists on $r$ adjacent strands of the $(p, q)$ -torus link. In this paper, we classify twisted torus links that a…

math.GT2022

An upper bound of the numbers of minimally intersecting filling coherent pairs

Hong Chang

Let $S_{g}$ denoting the genus $g$ closed orientable surface. An {\em origami} (or flat structure) on $S_{g}$ is obtained from a finite collection of unit Euclidean squares by gluing e…

Minimal Filling K-Systems of Curves

Twisted torus links that are unlinks

An upper bound of the numbers of minimally intersecting filling coherent pairs

Minimal Filling $K$ -Systems of Curves