15 citations · 15 across the 3 of their papers we have counts for
5 papers · 1 filter
The smallest number of vertices in a 2-arc-strong digraph which has no good pair
Ran Gu, Gregory Gutin, Shasha Li +2
Bang-Jensen, Bessy, Havet and Yeo showed that every digraph of independence number at most 2 and arc-connectivity at least 2 has an out-branching and an in-branching wh…
Anti-Ramsey numbers of paths and cycles in hypergraphs
Ran Gu, Jiaao Li, Yongtang Shi
The anti-Ramsey problem was introduced by Erdős, Simonovits and Sós in 1970s. The anti-Ramsey number of a hypergraph , , is the smallest integer…
Conflict-free connection number of random graphs
Ran Gu, Xueliang Li
An edge-colored graph is 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 conflict-free c…
Proper connection number of random graphs
Ran Gu, Xueliang Li, Zhongmei Qin
A path in an edge-colored graph is called a proper path if no two adjacent edges of the path are colored the same. For a connected graph , the proper connection number o…
The generalized 3-connectivity of random graphs
Ran Gu, Xueliang Li, Yongtang Shi
The generalized connectivity of a graph was introduced by Chartrand et al. Let be a nonempty set of vertices of , and be defined as the largest number of internal…