4 citations · 5 across the 7 of their papers we have counts for
12 papers · 1 filter
Reconfiguration graphs of -minor-free graphs
Ruijuan Gu, Hui Lei, Zhaoxiang Li +2
The -reconfiguration graph of a graph , denoted by , is the graph whose vertices are the proper -colorings of , with an edge between two co…
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{…
Some Mader-perfect graph classes
Hui Lei, Siyan Li, Xiaopan Lian +1
The dichromatic number of , denoted by , is the smallest integer such that admits an acyclic -coloring. We use to d…
Weak-odd chromatic index of special digraph classes
Ruijuan Gu, Hui Lei, Xiaopan Lian +1
Give a digraph , let and be semi-cuts of . A mapping is call…