Jennifer S. Zito

Learn More
A graph is k-extendable if every independent set of size k is contained in a maximum independent set. This generalizes the concept of a B-graph (i.e. I-extendable graph) introduced by Berge and the concept of a well-covered graph (i.e. k-extendable for every integer k) introduced by Plummer. For various graph families we present some characterizations of(More)
  • 1