Bounds for the Sum-Balaban index and (revised) Szeged index of regular graphs. - Hui Lei 002; Hua Yang (Appl. Math. Comput., 2015)

Analyzing lattice networks through substructures. - Hui Lei 002; Tao Li 022; Yuede Ma; Hua Wang 003 (Appl. Math. Comput., 2018)

Total rainbow connection of digraphs. - Hui Lei 002; Henry Liu; Colton Magnant; Yongtang Shi (Discret. Appl. Math., 2018)

On the generalized Wiener polarity index of trees with a given diameter. - Jun Yue; Hui Lei 002; Yongtang Shi (Discret. Appl. Math., 2018)

Star 5-edge-colorings of subcubic multigraphs. - Hui Lei 002; Yongtang Shi; Zi-Xia Song; Tao Wang 005 (Discret. Math., 2018)

Rainbow vertex connection of digraphs. - Hui Lei 002; Shasha Li; Henry Liu; Yongtang Shi (J. Comb. Optim., 2018)

Star chromatic index of subcubic multigraphs. - Hui Lei 002; Yongtang Shi; Zi-Xia Song (J. Graph Theory, 2018)

The generalized connectivity of the line graph and the total graph for the complete bipartite graph. - Yinkui Li; Ruijuan Gu; Hui Lei 002 (Appl. Math. Comput., 2019)

Extremal problems on saturation for the family of k-edge-connected graphs. - Hui Lei 002; Suil O; Yongtang Shi; Douglas B. West; Xuding Zhu (Discret. Appl. Math., 2019)

Rainbow domination numbers of generalized Petersen graphs. - Zhipeng Gao; Hui Lei 002; Kui Wang (Appl. Math. Comput., 2020)

Rainbow numbers for small graphs in planar graphs. - Zhongmei Qin; Hui Lei 002; Shasha Li (Appl. Math. Comput., 2020)

k-Ary spanning trees contained in tournaments. - Jiangdong Ai; Hui Lei 002; Yongtang Shi; Shunyu Yao 005; Zan-Bo Zhang (Discret. Appl. Math., 2020)

Gallai-Ramsey numbers of C10 and C12. - Hui Lei 002; Yongtang Shi; Zi-Xia Song; Jingmei Zhang (Australas. J Comb., 2021)

Note on (semi-)proper orientation of some triangulated planar graphs. - Ruijuan Gu; Hui Lei 002; Yulai Ma; Zhenyu Taoqiu (Appl. Math. Comput., 2021)

Maximisers of the hypergraph Lagrangian outside the principal range. - Ran Gu; Hui Lei 002; Yuejian Peng; Yongtang Shi (Appl. Math. Comput., 2022)

On k-uniform random hypergraphs without generalized fans. - Ran Gu; Hui Lei 002; Yongtang Shi (Discret. Appl. Math., 2022)

Graph Classes with Locally Irregular Chromatic Index at most 4. - Hui Lei 002; Xiaopan Lian; Yongtang Shi; Ran Zhao (J. Optim. Theory Appl., 2022)

Saturation numbers for tPk with k less than 6. - Shujuan Cao; Hui Lei 002; Xiaopan Lian; Shunyu Yao 005; Junxue Zhang 002 (Discret. Appl. Math., 2023)

Weak-odd chromatic index of special digraph classes. - Ruijuan Gu; Hui Lei 002; Xiaopan Lian; Zhenyu Taoqiu (Discret. Appl. Math., 2023)

Proper orientation, proper biorientation and semi-proper orientation numbers of graphs. - Jiangdong Ai; Stefanie Gerke; Gregory Z. Gutin; Hui Lei 002; Yongtang Shi (J. Comb. Optim., 2023)

On critical graphs for the chromatic edge-stability number. - Hui Lei 002; Xiaopan Lian; Xianhao Meng; Yongtang Shi; Yiqiao Wang 002 (Discret. Math., 2023)

On the saturation spectrum of families of cycle subdivisions. - Rongling Lang; Hui Lei 002; Junxue Zhang 002 (Theor. Comput. Sci., 2023)

Some mader-perfect graph classes. - Rongling Lang; Hui Lei 002; Siyan Li; Xiaopan Lian; Susu Wang (Appl. Math. Comput., 2023)

A characterization of 4-χS-vertex-critical graphs for packing sequences with s1=1 and s2≥3. - Sandi Klavzar; Hui Lei 002; Xiaopan Lian; Yongtang Shi (Discret. Appl. Math., 2023)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials. - Jiangdong Ai; Gregory Z. Gutin; Hui Lei 002; Anders Yeo; Yacong Zhou (CoRR, 2024)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree. - Gregory Z. Gutin; Hui Lei 002; Anders Yeo; Yacong Zhou (CoRR, 2024)

A note on rainbow-free colorings of uniform hypergraphs. - Ran Gu; Hui Lei 002; Yongtang Shi; Yiqiao Wang 002 (Discret. Appl. Math., 2024)

The saturation number of K3,3. - Shenwei Huang; Hui Lei 002; Yongtang Shi; Junxue Zhang 002 (Discret. Math., 2024)

On k-anti-traceability of oriented graphs. - Bin Chen; Stefanie Gerke; Gregory Z. Gutin; Hui Lei 002; Heis Parker-Cox; Yacong Zhou (Discret. Math., 2025)