Binding Number, Minimum Degree, and Cycle Structure in Graphs

  • Authors:

  • D. Bauer;E. Schmeichel

  • Affiliations:

  • DEPARTMENT OF MATHEMATICAL SCIENCES, STEVENS INSTITUTE OF TECHNOLOGY, HOBOKEN, NJ07030;DEPARTMENT OF MATHEMATICS, SAN JOSE STATE UNIVERSITY, SAN JOSE, CA95192

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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. © 2012 Wiley Periodicals, Inc.