84 citations · 579 across the 67 of their papers we have counts for
6 papers · 1 filter
Coloring graphs with two odd cycle lengths
Jie Ma, Bo Ning
In this paper we determine the chromatic number of graphs with two odd cycle lengths. Let be a graph and be the set of all odd cycle lengths of . We prove that: (1) I…
On a conjecture of Chen-Guo-Wang
Bo Ning, Yu Zheng
Towards confirming Sun's conjecture on the strict log-concavity of combinatorial sequence involving the n Bernoulli number, Chen, Guo and Wang proposed a conjecture about the l…
Degree conditions restricted to induced paths for hamiltonicity of claw-heavy graphs
Binlong Li, Bo Ning, Shenggui Zhang
Broersma and Veldman proved that every 2-connected claw-free and -free graph is hamiltonian. Chen et al. extended this result by proving every 2-connected claw-heavy and …
Heavy subgraphs, stability and hamiltonicity
Binlong Li, Bo Ning
Let be a graph. Adopting the terminology of Broersma et al. and Čada, respectively, we say that is 2-heavy if every induced claw () of contains two end-vertice…
Extremal problems on the Hamiltonicity of claw-free graphs
Binlong Li, Bo Ning, Xing Peng
In 1962, Erdős proved that if a graph with vertices satisfies $$ e(G)>\max\left\{\binom{n-k}{2}+k^2,\binom{\lceil(n+1)/2\rceil}{2}+\left\lfloor \frac{n-1}{2}\right\rfloor^2…
Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
Binlong Li, Bo Ning
In 1962, Erdős gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number, and minimum degree of graphs which generalized Ore's theorem. One year la…