7 citations · 17 across the 10 of their papers we have counts for
10 papers · 1 filter
Ramsey Achievement Games on Graphs : Algorithms and Bounds
Xiumin Wang, Zhong Huang, Xiangqian Zhou +2
In 1982, Harary introduced the concept of Ramsey achievement game on graphs. Given a graph with no isolated vertices. Consider the following game played on the complete graph $…
A note on a new result related to Chartrand, Kaigars and Lick's theorem
Zhong Huang, Meng Ji
In this note, we prove a theorem covering Chartrand, Kaigars, and Lick's theorem in [Proc. Amer. Math. Soc. 32 (1972), 63-68]. As an application, we give a simpler proof of theorem…
Bounds for the rainbow disconnection number of graphs
Xuqing Bai, Zhong Huang, Xueliang Li
An edge-cut of an edge-colored connected graph is called a rainbow-cut if no two edges in the edge-cut are colored the same. An edge-colored graph is rainbow disconnected if fo…
Hardness results for three kinds of colored connections of graphs
Zhong Huang, Xueliang Li
The concept of rainbow connection number of a graph was introduced by Chartrand et al. in 2008. Inspired by this concept, other concepts on colored version of connectivity in graph…
Hardness results for rainbow disconnection of graphs
Zhong Huang, Xueliang Li
Let be a nontrivial connected, edge-colored graph. An edge-cut of is called a rainbow cut if no two edges in are colored with a same color. An edge-coloring of …
More on rainbow disconnection in graphs
Xuqing Bai, Renying Chang, Xueliang Li
Let be a nontrivial edge-colored connected graph. An edge-cut of is called a rainbow cut if no two edges of it are colored the same. An edge-colored graph is rainbo…
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…