Bing Chen

activity

20122019

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

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2019

Subdivisions of vertex-disjoint cycles in bipartite graphs

Shengning Qiao, Bing Chen

Let $n \geq 6, k \geq 0$ be two integers. Let $H$ be a graph of order $n$ with $k$ components, each of which is an even cycle of length at least $6$ and $G$ be a bipartite graph with…

math.CO2013

Hamilton cycles in almost distance-hereditary graphs

Bing Chen, Bo Ning

Let $G$ be a graph on $n \geq 3$ vertices. A graph $G$ is almost distance-hereditary if each connected induced subgraph $H$ of $G$ has the property $d_{H} (x, y) \leq d_{G} (x, y) + 1$ for…

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

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$ …