Prefer a chat interface with context about you and your work?
Binding Number, Minimum Degree, and Cycle Structure in Graphs
Abstract 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.