14 citations · 14 across the 5 of their papers we have counts for
5 papers
The Complexity of Mixed Arc-Disjoint Spanning Subdigraphs with Antistrong Connectivity
Jiangdong Ai, Gregory Gutin, Hui Lei +1
A trail is antidirected if its arcs alternate between forward and backward. A digraph is antistrong if, for every ordered pair of distinct vertices , it contains a…
The Minimum Weighting Ratio Problem and Its Application in Chordal Graphs
Hui Lei, Mei Lu, Yongtang Shi +2
Constructing the maximum spanning tree of an edge-weighted connected graph is one of the important research topics in computer science and optimization, and the related res…
Reconfiguration graphs for vertex colorings of -free graphs
Hui Lei, Yulai Ma, Zhengke Miao +2
For any positive integer , the reconfiguration graph for all -colorings of a graph , denoted by , is the graph where vertices represent the -colorings…
Graph operations and a unified method for kinds of Turán-type problems on paths, cycles and matchings
Jiangdong Ai, Hui Lei, Bo Ning +1
Let be a connected graph and a graph parameter. We say that is feasible if satisfies the following properties: (I) $\mathcal{…
The minimal size of a graph with generalized connectivity
Shasha Li, Xueliang Li, Yongtang Shi
Let be a nontrivial connected graph of order and an integer with . For a set of vertices of , let denote the maximum number of e…