Bo Ning

Orcid: 0000-0002-9622-5567

  • Nankai University, College of Computer Science, Tianjin, China
  • Tianjin University, Center for Applied Mathematics, China (former)
  • Northwestern Polytechnical University, Department of Applied Mathematics, Xi'an, China (PhD 2015)

According to our database1, Bo Ning authored at least 36 papers between 2013 and 2023.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Eigenvalues and cycles of consecutive lengths.
J. Graph Theory, July, 2023

Counting substructures and eigenvalues I: Triangles.
Eur. J. Comb., May, 2023

Stability of Woodall's Theorem and Spectral Conditions for Large Cycles.
Electron. J. Comb., 2023

Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles.
J. Comb. Theory B, 2022

Note on Rainbow Triangles in Edge-Colored Graphs.
Graphs Comb., 2022

Monitoring the edges of product networks using distances.
CoRR, 2022

A complete solution to the Cvetković-Rowlinson conjecture.
J. Graph Theory, 2021

Exact bipartite Turán numbers of large even cycles.
J. Graph Theory, 2021

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations.
J. Graph Theory, 2021

A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture.
J. Comb. Theory B, 2021

Eigenvalues and triangles in graphs.
Comb. Probab. Comput., 2021

An Ore-type condition for large k -factor and disjoint perfect matchings.
J. Graph Theory, 2020

The formula for Turán number of spanning linear forests.
Discret. Math., 2020

Maximizing the number of cliques in graphs with given matching number.
Discret. Appl. Math., 2020

Extensions of the Erdős-Gallai theorem and Luo's theorem.
Comb. Probab. Comput., 2020

Stability Results on the Circumference of a Graph.
Comb., 2020

The Randić index and signless Laplacian spectral radius of graphs.
Discret. Math., 2019

On sufficient conditions for rainbow cycles in edge-colored graphs.
Discret. Math., 2019

Coloring Graphs with Two Odd Cycle Lengths.
SIAM J. Discret. Math., 2018

Extremal problems on the Hamiltonicity of claw-free graphs.
Discret. Math., 2018

Modeling and Efficiency Analysis of Clock Glitch Fault Injection Attack.
Proceedings of the Asian Hardware Oriented Security and Trust Symposium, 2018

Heavy subgraphs, stability and Hamiltonicity.
Discuss. Math. Graph Theory, 2017

On some papers of Nikiforov.
Ars Comb., 2017

Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions.
Graphs Comb., 2016

Color Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs.
Graphs Comb., 2016

Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition.
Graphs Comb., 2016

A note on nowhere-zero 3-flows and Z_3-connectivity.
Ars Math. Contemp., 2016

Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs.
Inf. Process. Lett., 2015

Characterizing Heavy Subgraph Pairs for Pancyclicity.
Graphs Comb., 2015

A note on the number of spanning trees of line digraphs.
Discret. Math., 2015

Rainbow triangles in edge-colored graphs.
Eur. J. Comb., 2014

Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs.
Discret. Math. Algorithms Appl., 2014

The Ramsey Numbers of Paths Versus Wheels: a Complete Solution.
Electron. J. Comb., 2014

Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs.
Australas. J Comb., 2014

Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity.
Inf. Process. Lett., 2013

Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs.
Discret. Math., 2013