Bo Ning

activity

20112026

most citedEigenvalues and triangles in graphs

84 citations · 579 across the 67 of their papers we have counts for

collaborators

Showing 2012Show all

5 papers · 1 filter

math.CO2012★ 1 cited

Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs

Bo Ning, Shenggui Zhang, Bing Chen

Let claw be the graph $K_{1, 3}$ . A graph $G$ on $n \geq 3$ vertices is called \emph{o}-heavy if each induced claw of $G$ has a pair of end-vertices with degree sum at least $n$ , and…

math.CO2012★ 52 cited

Rainbow triangles in edge-colored graphs

Binlong Li, Bo Ning, Chuandong Xu +1

Let $G$ be an edge-colored graph. The color degree of a vertex $v$ of $G$ , is defined as the number of colors of the edges incident to $v$ . The color number of $G$ is defined as th…

math.CO2012

Two sufficient conditions for the existence of Hamilton cycles in graphs

Bo Ning, Bing Chen, Shenggui Zhang

Let $G$ be a graph on $n \geq 3$ vertices, claw the bipartite graph $K_{1, 3}$ , and $Z_{i}$ the graph obtained from a triangle by attaching a path of length $i$ to its one vertex. $G$ …

math.CO2012★ 13 cited

Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs

Bo Ning, Shenggui Zhang

Bedrossian characterized all pairs of forbidden subgraphs for a 2-connected graph to be Hamiltonian. Instead of forbidding some induced subgraphs, we relax the conditions for graph…

math.CO2012★ 1 cited

A note on heterochromatic cycles of length 4 in edge-colored graphs

Bo Ning, Shenggui Zhang

Let $G$ be an edge-colored graph. A heterochromatic cycle of $G$ is one in which every two edges have different colors. For a vertex $v \in V (G)$ , let $C N (v)$ denote the set of colo…