79 citations · 217 across the 44 of their papers we have counts for
4 papers · 2 filters
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…
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…
On path-quasar Ramsey numbers
Binlong Li, Bo Ning
Let and be two given graphs. The Ramsey number is the least integer such that for every graph on vertices, either contains a or $\ove…