84 citations · 579 across the 67 of their papers we have counts for
7 papers · 1 filter
On some papers of Nikiforov
Bo Ning
The well known Mantel's Theorem states that a graph on vertices and edges contains a triangle if . Nosal proved that every graph on edges contains a tr…
Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs
Roman Čada, Binlong Li, Bo Ning +1
A graph is called \emph{claw-free} if it contains no induced subgraph isomorphic to . Matthews and Sumner proved that a 2-connected claw-free graph is hamiltonian if e…
Solution to a problem on hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions
Bo Ning, Shenggui Zhang, Binlong Li
A graph is called \emph{claw-o-heavy} if every induced claw () of has two end-vertices with degree sum at least in . For a given graph , is call…
A note on nowhere-zero 3-flow and Z_3-connectivity
Fuyuan Chen, Bo Ning
There are many major open problems in integer flow theory, such as Tutte's 3-flow conjecture that every 4-edge-connected graph admits a nowhere-zero 3-flow, Jaeger et al.'s conject…
Spectral radius and traceability of connected claw-free graphs
Bo Ning, Binlong Li
Let be a connected claw-free graph on vertices and be its complement graph. Let be the spectral radius of . Denote by the graph consist…
Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
Bo Ning
In 1992, Manoussakis conjectured that a strongly 2-connected digraph on vertices is hamiltonian if for every two distinct pairs of independent vertices and we h…