Bo Ning

Publication Activity (10 Years)

Years Active: 2013-2023
Publications (10 Years): 26

Top Topics

Sufficient Conditions

Connected Graphs

Top Venues

J. Graph Theory

Comb. Probab. Comput.

Publications

Binlong Li, Bo Ning
Eigenvalues and cycles of consecutive lengths. J. Graph Theory 103 (3) (2023)
Binlong Li, Bo Ning
Stability of Woodall's Theorem and Spectral Conditions for Large Cycles. Electron. J. Comb. 30 (1) (2023)
Wen Li, Ralf Klasing, Yaping Mao, Bo Ning
Monitoring the edges of product networks using distances. CoRR (2022)
Xiaozheng Chen, Xueliang Li, Bo Ning
Note on Rainbow Triangles in Edge-Colored Graphs. Graphs Comb. 38 (3) (2022)
Binlong Li, Jie Ma, Bo Ning
Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles. J. Comb. Theory, Ser. B 152 (2022)
Huiqiu Lin, Bo Ning, Baoyindureng Wu
Eigenvalues and triangles in graphs. Comb. Probab. Comput. 30 (2) (2021)
Binlong Li, Bo Ning
A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture. J. Comb. Theory, Ser. B 146 (2021)
Fengming Dong, Jun Ge, Helin Gong, Bo Ning, Zhangdong Ouyang, Eng Guan Tay
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations. J. Graph Theory 96 (3) (2021)
Huiqiu Lin, Bo Ning
A complete solution to the Cvetković-Rowlinson conjecture. J. Graph Theory 97 (3) (2021)
Binlong Li, Bo Ning
Exact bipartite Turán numbers of large even cycles. J. Graph Theory 97 (4) (2021)
Hongliang Lu, Bo Ning
An Ore-type condition for large k -factor and disjoint perfect matchings. J. Graph Theory 94 (3) (2020)
Jie Ma, Bo Ning
Stability Results on the Circumference of a Graph. Comb. 40 (1) (2020)
Bo Ning, Xing Peng
Extensions of the Erdős-Gallai theorem and Luo's theorem. Comb. Probab. Comput. 29 (1) (2020)
Bo Ning, Jian Wang
The formula for Turán number of spanning linear forests. Discret. Math. 343 (8) (2020)
Xiuzhuan Duan, Bo Ning, Xing Peng, Jian Wang, Weihua Yang
Maximizing the number of cliques in graphs with given matching number. Discret. Appl. Math. 287 (2020)
Bo Ning, Xing Peng
The Randić index and signless Laplacian spectral radius of graphs. Discret. Math. 342 (3) (2019)
Shinya Fujita, Bo Ning, Chuandong Xu, Shenggui Zhang
On sufficient conditions for rainbow cycles in edge-colored graphs. Discret. Math. 342 (7) (2019)
Binlong Li, Bo Ning, Xing Peng
Extremal problems on the Hamiltonicity of claw-free graphs. Discret. Math. 341 (10) (2018)
Jie Ma, Bo Ning
Coloring Graphs with Two Odd Cycle Lengths. SIAM J. Discret. Math. 32 (1) (2018)
Bo Ning, Qiang Liu
Modeling and Efficiency Analysis of Clock Glitch Fault Injection Attack. AsianHOST (2018)
Binlong Li, Bo Ning
Heavy subgraphs, stability and Hamiltonicity. Discuss. Math. Graph Theory 37 (3) (2017)
Bo Ning
On some papers of Nikiforov. Ars Comb. 135 (2017)
Bo Ning, Shenggui Zhang, Binlong Li
Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions. Graphs Comb. 32 (3) (2016)
Fuyuan Chen, Bo Ning
A note on nowhere-zero 3-flows and Z_3-connectivity. Ars Math. Contemp. 10 (1) (2016)
Ruonan Li, Bo Ning, Shenggui Zhang
Color Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs. Graphs Comb. 32 (5) (2016)
Binlong Li, Bo Ning, Shenggui Zhang
Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition. Graphs Comb. 32 (1) (2016)
Binlong Li, Bo Ning, Hajo Broersma, Shenggui Zhang
Characterizing Heavy Subgraph Pairs for Pancyclicity. Graphs Comb. 31 (3) (2015)
Chuandong Xu, Shenggui Zhang, Bo Ning, Binlong Li
A note on the number of spanning trees of line digraphs. Discret. Math. 338 (5) (2015)
Bo Ning
Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs. Inf. Process. Lett. 115 (2) (2015)
Binlong Li, Bo Ning
The Ramsey Numbers of Paths Versus Wheels: a Complete Solution. Electron. J. Comb. 21 (4) (2014)
Binlong Li, Bo Ning, Chuandong Xu, Shenggui Zhang
Rainbow triangles in edge-colored graphs. Eur. J. Comb. 36 (2014)
Bo Ning, Shenggui Zhang, Bing Chen
Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs. Discret. Math. Algorithms Appl. 6 (3) (2014)
Bo Ning
Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs. Australas. J Comb. 58 (2014)
Bo Ning, Shenggui Zhang
Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs. Discret. Math. 313 (17) (2013)
Bo Ning
Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity. Inf. Process. Lett. 113 (19-21) (2013)