Degree sequences and graphs with disjoint spanning trees. - Hong-Jian Lai; Yanting Liang; Ping Li 023; Jinquan Xu (Discret. Appl. Math., 2011)

Group connectivity in line graphs. - Hong-Jian Lai; Hao Li; Ping Li 023; Yanting Liang; Senmei Yao (Discret. Math., 2011)

Every N2-Locally Connected claw-Free Graph with Minimum Degree at Least 7 is Z3-Connected. - Erling Wei; Ye Chen; Ping Li 023; Hong-Jian Lai (Discret. Math. Algorithms Appl., 2011)

Mod (2p+1)-orientations in line graphs. - Hong-Jian Lai; Hao Li; Ping Li 023; Yanting Liang; Senmei Yao (Inf. Process. Lett., 2011)

Characterization of removable elements with respect to having k disjoint bases in a matroid. - Ping Li 023; Hong-Jian Lai; Yanting Liang (Discret. Appl. Math., 2012)

Spanning cycles in regular matroids without small cocircuits. - Ping Li 023; Hong-Jian Lai; Yehong Shao; Mingquan Zhan (Eur. J. Comb., 2012)

The Connectivity and Diameter of Second Order Circuit Graphs of Matroids. - Jinquan Xu; Ping Li 023; Hong-Jian Lai (Graphs Comb., 2012)

Group connectivity of complementary graphs. - Xinmin Hou; Hong-Jian Lai; Ping Li 023; Cun-Quan Zhang (J. Graph Theory, 2012)

On Spanning Disjoint Paths in Line Graphs. - Ye Chen; Zhi-Hong Chen; Hong-Jian Lai; Ping Li 023; Erling Wei (Graphs Comb., 2013)

Characterizations of Strength Extremal Graphs. - Xiaofeng Gu 002; Hong-Jian Lai; Ping Li 023; Senmei Yao (Graphs Comb., 2014)

Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs. - Jinquan Xu; Ping Li 023; Zhengke Miao; Keke Wang; Hong-Jian Lai (Int. J. Comput. Math., 2014)

On Mod (2s+1)-Orientations of Graphs. - Ping Li 023; Hong-Jian Lai (SIAM J. Discret. Math., 2014)

Supereulerian graphs with width s and s-collapsible graphs. - Ping Li 023; Hao Li; Ye Chen; Herbert Fleischner; Hong-Jian Lai (Discret. Appl. Math., 2016)

Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs. - Xiaofeng Gu 002; Hong-Jian Lai; Ping Li 023; Senmei Yao (J. Graph Theory, 2016)

Strongly Spanning Trailable Graphs with Short Longest Paths. - Ping Li 023; Keke Wang; Mingquan Zhan; Hong-Jian Lai (Ars Comb., 2018)

Characterizations of matroids with an element lying in a restricted number of circuits. - Ping Li 023; Lan Wang; Yang Wu 007; Hong-Jian Lai (J. Comb. Optim., 2019)

On weighted modulo orientation of graphs. - Jian-Bing Liu; Ping Li 023; Jiaao Li; Hong-Jian Lai (Eur. J. Comb., 2020)

On the s-hamiltonianicity of an hourglass-free line graph. - Aimei Yu; Ping Li 023; Yang Wu 007; Hong-Jian Lai (Discret. Math., 2022)

Supereulerian regular matroids without small cocircuits. - Bofeng Huo; Qingsong Du; Ping Li 023; Yang Wu 007; Jun Yin; Hong-Jian Lai (J. Graph Theory, 2023)