# Search results for: Xueliang Li

*g*(

*D*) of a digraph

*D*and the minimum outdegree

*δ*

^{ + }(

*D*) of

*D*. The special case when

*g*(

*D*) = 3 has lately attracted wide attention. For an undirected graph

*G*, the binding number $bind(G)\geq \frac 3 2$ is a sufficient condition for

*G*to have a triangle (cycle with length 3). In this paper we generalize the concept...

Discrete Applied Mathematics > 2009 > 157 > 15 > 3332-3335

Discrete Applied Mathematics > 2002 > 120 > 1-3 > 45-53