4 citations · 4 across the 4 of their papers we have counts for
7 papers
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…
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…
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 ,…
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…