Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs. - Bo Ning 001; Shenggui Zhang (Discret. Math., 2013)

Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity. - Bo Ning 001 (Inf. Process. Lett., 2013)

Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs. - Bo Ning 001 (Australas. J Comb., 2014)

The Ramsey Numbers of Paths Versus Wheels: a Complete Solution. - Binlong Li; Bo Ning 001 (Electron. J. Comb., 2014)

Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs. - Bo Ning 001; Shenggui Zhang; Bing Chen 006 (Discret. Math. Algorithms Appl., 2014)

Rainbow triangles in edge-colored graphs. - Binlong Li; Bo Ning 001; Chuandong Xu; Shenggui Zhang (Eur. J. Comb., 2014)

A note on the number of spanning trees of line digraphs. - Chuandong Xu; Shenggui Zhang; Bo Ning 001; Binlong Li (Discret. Math., 2015)

Characterizing Heavy Subgraph Pairs for Pancyclicity. - Binlong Li; Bo Ning 001; Hajo Broersma; Shenggui Zhang (Graphs Comb., 2015)

Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs. - Bo Ning 001 (Inf. Process. Lett., 2015)

A note on nowhere-zero 3-flows and Z_3-connectivity. - Fuyuan Chen; Bo Ning 001 (Ars Math. Contemp., 2016)

Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition. - Binlong Li; Bo Ning 001; Shenggui Zhang (Graphs Comb., 2016)

Color Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs. - Ruonan Li; Bo Ning 001; Shenggui Zhang (Graphs Comb., 2016)

Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions. - Bo Ning 001; Shenggui Zhang; Binlong Li (Graphs Comb., 2016)

On some papers of Nikiforov. - Bo Ning 001 (Ars Comb., 2017)

Heavy subgraphs, stability and Hamiltonicity. - Binlong Li; Bo Ning 001 (Discuss. Math. Graph Theory, 2017)

Modeling and Efficiency Analysis of Clock Glitch Fault Injection Attack. - Bo Ning 001; Qiang Liu (AsianHOST, 2018)

Extremal problems on the Hamiltonicity of claw-free graphs. - Binlong Li; Bo Ning 001; Xing Peng (Discret. Math., 2018)

Coloring Graphs with Two Odd Cycle Lengths. - Jie Ma; Bo Ning 001 (SIAM J. Discret. Math., 2018)

On sufficient conditions for rainbow cycles in edge-colored graphs. - Shinya Fujita 001; Bo Ning 001; Chuandong Xu; Shenggui Zhang (Discret. Math., 2019)

The Randić index and signless Laplacian spectral radius of graphs. - Bo Ning 001; Xing Peng (Discret. Math., 2019)

Stability Results on the Circumference of a Graph. - Jie Ma 002; Bo Ning 001 (Comb., 2020)

Extensions of the Erdős-Gallai theorem and Luo's theorem. - Bo Ning 001; Xing Peng (Comb. Probab. Comput., 2020)

Maximizing the number of cliques in graphs with given matching number. - Xiuzhuan Duan; Bo Ning 001; Xing Peng; Jian Wang 092; Weihua Yang (Discret. Appl. Math., 2020)

The formula for Turán number of spanning linear forests. - Bo Ning 001; Jian Wang 092 (Discret. Math., 2020)

An Ore-type condition for large k -factor and disjoint perfect matchings. - Hongliang Lu; Bo Ning 001 (J. Graph Theory, 2020)

Eigenvalues and triangles in graphs. - Huiqiu Lin; Bo Ning 001; Baoyindureng Wu (Comb. Probab. Comput., 2021)

A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture. - Binlong Li; Bo Ning 001 (J. Comb. Theory B, 2021)

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations. - Fengming Dong; Jun Ge; Helin Gong; Bo Ning 001; Zhangdong Ouyang; Eng Guan Tay (J. Graph Theory, 2021)

Exact bipartite Turán numbers of large even cycles. - Binlong Li; Bo Ning 001 (J. Graph Theory, 2021)

A complete solution to the Cvetković-Rowlinson conjecture. - Huiqiu Lin; Bo Ning 001 (J. Graph Theory, 2021)

Note on Rainbow Triangles in Edge-Colored Graphs. - Xiaozheng Chen; Xueliang Li 001; Bo Ning 001 (Graphs Comb., 2022)

Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles. - Binlong Li; Jie Ma 002; Bo Ning 001 (J. Comb. Theory B, 2022)

Stability of Woodall's Theorem and Spectral Conditions for Large Cycles. - Binlong Li; Bo Ning 001 (Electron. J. Comb., 2023)

Counting substructures and eigenvalues I: Triangles. - Bo Ning 001; Mingqing Zhai (Eur. J. Comb., 2023)

Eigenvalues and cycles of consecutive lengths. - Binlong Li; Bo Ning 001 (J. Graph Theory, 2023)

Counting rainbow triangles in edge-colored graphs. - Xueliang Li 001; Bo Ning 001; Yongtang Shi; Shenggui Zhang (J. Graph Theory, 2024)

Note on Mantel Theorem and Turán Theorem. - Bo Ning 001 (Graphs Comb., 2024)

The number of edges in graphs with bounded clique number and circumference. - Chunyang Dou; Bo Ning 001; Xing Peng (Adv. Appl. Math., 2025)

An inductive proof of Dirac's theorem on Hamilton cycles. - Bo Ning 001 (Discret. Appl. Math., 2025)

Monitoring the edges of product networks using distances. - Wen Li; Ralf Klasing; Yaping Mao; Bo Ning 001 (J. Comput. Syst. Sci., 2025)

Ramsey Numbers of Books versus Long Cycles. - Fu-Tao Hu; Qizhong Lin; Tomasz Luczak 001; Bo Ning 001; Xing Peng (SIAM J. Discret. Math., 2025)