Bo Ning
Orcid: 0000000296225567Affiliations:
 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 database^{1},
Bo Ning
authored at least 36 papers
between 2013 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on scopus.com

on orcid.org
On csauthors.net:
Bibliography
2023
J. Graph Theory, July, 2023
Eur. J. Comb., May, 2023
Electron. J. Comb., 2023
2022
J. Comb. Theory B, 2022
Graphs Comb., 2022
CoRR, 2022
2021
J. Graph Theory, 2021
J. Graph Theory, 2021
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations.
J. Graph Theory, 2021
J. Comb. Theory B, 2021
Comb. Probab. Comput., 2021
2020
J. Graph Theory, 2020
Discret. Math., 2020
Discret. Appl. Math., 2020
Comb. Probab. Comput., 2020
Comb., 2020
2019
Discret. Math., 2019
Discret. Math., 2019
2018
SIAM J. Discret. Math., 2018
Discret. Math., 2018
Proceedings of the Asian Hardware Oriented Security and Trust Symposium, 2018
2017
Discuss. Math. Graph Theory, 2017
On some papers of Nikiforov.
Ars Comb., 2017
2016
Solution to a Problem on Hamiltonicity of Graphs Under Ore and FanType Heavy Subgraph Conditions.
Graphs Comb., 2016
Graphs Comb., 2016
Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition.
Graphs Comb., 2016
Ars Math. Contemp., 2016
2015
Inf. Process. Lett., 2015
Graphs Comb., 2015
Discret. Math., 2015
2014
Eur. J. Comb., 2014
Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs.
Discret. Math. Algorithms Appl., 2014
Electron. J. Comb., 2014
Australas. J Comb., 2014
2013
Fantype degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity.
Inf. Process. Lett., 2013
Discret. Math., 2013