id: 06081441
dt: j
an: 06081441
au: Bauer, D.; Schmeichel, E.
ti: Binding number, minimum degree, and cycle structure in graphs.
so: J. Graph Theory 71, No. 2, 219-228 (2012).
py: 2012
pu: John Wiley \& Sons, New York, NY
la: EN
cc: 
ut: binding number; cycle structure
ci: 
li: doi:10.1002/jgt.21633
ab: Summary: A well-known theorem of Woodall states that if a graph $G$ has
    binding number at least $3/2$, then $G$ is hamiltonian. We generalize
    Woodall’s theorem as follows.
rv: