4 citations · 10 across the 15 of their papers we have counts for
8 papers · 1 filter
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…