Shenggui Zhang

most citedOn traceability of claw-o_{-1}-heavy graphs

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

collaborators

2 papers

math.CO2013★ 1 cited

On traceability of claw-o_{-1}-heavy graphs

Binlong Li, Shenggui Zhang

A graph is called traceable if it contains a Hamilton path, i.e., a path passing through all its vertices. Let $G$ be a graph on $n$ vertices. $G$ is called claw- $o_{- 1}$ -heavy if…

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