Premium
Binding Number, Minimum Degree, and Cycle Structure in Graphs
Author(s) -
Bauer D.,
Schmeichel E.
Publication year - 2012
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21633
Subject(s) - mathematics , combinatorics , degree (music) , discrete mathematics , acoustics , physics
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.