4 citations · 10 across the 15 of their papers we have counts for
15 papers
Minimal Filling -Systems of Curves
Hong Chang, Xiao Chen, Wujie Shen
In this paper, we determine the exact minimal number of curves in a filling -system on an oriented surface of genus for any positive integers and .
Twisted torus links that are unlinks
Hong Chang, Thiago de Paiva, Qing Lan
A twisted torus link is obtained by performing full twists on adjacent strands of the -torus link. In this paper, we classify twisted torus links that a…
A construction of minimal coherent filling pairs
Hong Chang, William W. Menasco
Let denote the genus closed orientable surface. A \emph{coherent filling pair} of simple closed curves, in , is a filling pair that has its geometric interse…
Obstructions of extension of vector bundles
Vladimir Baranovsky, Hongseok Chang
In the holomorphic or algebraic setting we consider a vector bundle E on a smooth subvariety X in a smooth variety Y over a field of characteristic zero. Assuming E extends to the…
An upper bound of the numbers of minimally intersecting filling coherent pairs
Hong Chang
Let denoting the genus closed orientable surface. An {\em origami} (or flat structure) on is obtained from a finite collection of unit Euclidean squares by gluing e…
Efficient geodesics in the curve complex and their dot graphs
Hong Chang
For the complex of curves of a closed orientable surface of genus , , the notion of efficient geodesic in was introduced in arXiv:1408.4133. There it was e…
Origami edge-paths in the curve graph
Hong Chang, Xifeng Jin, William W. Menasco
An "origami" (or flat structure) on a closed oriented surface, , of genus is obtained from a finite collection of unit Euclidean squares by gluing each right edge t…
More on limited packings in graphs
Xuqing Bai, Hong Chang, Xueliang Li
A set of vertices in a graph is called a \emph{-limited packing} if for each vertex of , its closed neighbourhood has at most vertices in . The \emph{-l…
Conflict-free connection of trees
Hong Chang, Meng Ji, Xueliang Li +1
We study the conflict-free connection coloring of trees, which is also the conflict-free coloring of the so-called edge-path hypergraphs of trees. We first prove that for a tree $T…
Graphs with conflict-free connection number two
Hong Chang, Trung Duy Doan, Zhong Huang +3
An edge-colored graph is \emph{conflict-free connected} if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. The \emph{c…
Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs
Hong Chang, Zhong Huang, Xueliang Li +2
An edge-colored graph is \emph{conflict-free connected} if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The…
More on the -color connection number of a graph
Hong Chang, Zhong Huang, Xueliang Li
An edge-colored graph is -color connected if, between each pair of vertices, there exists a path using at least different colors. The -color connection number of ,…
Degree sum conditions for graphs to have proper connection number 2
Hong Chang, Zhong Huang, Xueliang Li
A path in an edge-colored graph is a \emph{proper path} if no two adjacent edges of are colored with the same color. The graph is \emph{proper connected} if, betwee…
The -proper index of graphs
Hong Chang, Xueliang Li, Colton Magnant +1
A tree in an edge-colored graph is called a {\it proper tree} if no two adjacent edges of receive the same color. Let be a connected graph of order and be an in…
Some upper bounds for the -proper index of graphs
Hong Chang, Xueliang Li, Zhongmei Qin
A tree in an edge-colored graph is a {\it proper tree} if no two adjacent edges of receive the same color. Let be a connected graph of order and be a fixed inte…