21 citations · 59 across the 14 of their papers we have counts for
6 papers · 1 filter
Oriented diameter and rainbow connection number of a graph
Xiaolong Huang, Hengzhe Li, Xueliang Li +1
The oriented diameter of a bridgeless graph is . A path in an edge-colored graph , where adjacent edges may have the same co…
Upper bound for the rainbow connection number of bridgeless graphs with diameter 3
Hengzhe Li, Xueliang Li, Yuefang Sun
A path in an edge-colored graph , where adjacent edges may have the same color, is called rainbow if no two edges of the path are colored the same. The rainbow connection number…
Note on the oriented diameter of graphs with diameter 3
Hengzhe Li, Xueliang Li, Yuefang Sun +1
In 1978, Chvátal and Thomassen showed that every bridgeless graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest value $f…
Asymptotic value of the minimal size of a graph with rainbow connection number 2
Hengzhe Li, Xueliang Li, Yuefang Sun
A path in an edge (vertex)-colored graph , where adjacent edges (vertices) may have the same color, is called a rainbow path if no pair of edges (internal vertices) of the path…
The generalized 3-connectivity of Cartesian product graphs
Hengzhe Li, Xueliang Li, Yuefang Sun
The generalized connectivity of a graph, which was introduced recently by Chartrand et al., is a generalization of the concept of vertex connectivity. Let be a nonempty set of…
Rainbow connection of graphs with diameter 2
Hengzhe Li, Xueliang Li, Sujuan Liu
A path in an edge-colored graph , where adjacent edges may have the same color, is called a rainbow path if no two edges of the path are colored the same. The rainbow connection…