Bing Chen

collaborators

Showing math.COShow all

2 papers · 1 filter

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