Well-covered graphs and extendability

Abstract 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. 1-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 well-covered and k-extendable graphs. We show that in order to determine whether a graph is well-covered it is sometimes sufficient to verify that it is k-extendable for small values of k. For many classes of graphs, this leads to efficient algorithms for recognizing well-covered graphs.

[1]  Jo Ann W. Staples,et al.  On some subclasses of well-covered graphs , 1979, J. Graph Theory.

[2]  Branko Grünbaum,et al.  Matchings in polytopal graphs , 1974, Networks.

[3]  M. Plummer.  Some covering concepts in graphs , 1970 .

[4]  Odile Favaron.  Very well covered graphs , 1982, Discret. Math..

[5]  M D Plummer.  Matching Extension and Connectivity in Graphs. 1. Introduction and Terminology , 1986 .

[6]  Martin Farber,et al.  Domination in Permutation Graphs , 1985, J. Algorithms.

[7]  Claude Berge,et al.  Some common properties for regulizable graphs, edge-critical graphs and B-graphs , 1980, Graph Theory and Algorithms.

[8]  Yehoshua Perl,et al.  Clustering and domination in perfect graphs , 1984, Discret. Appl. Math..

[9]  Martin Farber,et al.  Independent domination in chordal graphs , 1982, Oper. Res. Lett..

[10]  Richard J. Nowakowski,et al.  A characterization of well-covered graphs that contain neither 4- nor 5-cycles , 1994, J. Graph Theory.

[11]  Mordechai Lewin.  Matching-perfect and cover-perfect graphs , 1974 .

[12]  L. Lovász,et al.  Polynomial Algorithms for Perfect Graphs , 1984 .

[13]  Richard J. Nowakowski,et al.  A Characterization of Well Covered Graphs of Girth 5 or Greater , 1993, J. Comb. Theory, Ser. B.

[14]  C. Berge.  Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs , 1982 .

[15]  Ramesh S. Sankaranarayana,et al.  Complexity results for well-covered graphs , 1992, Networks.

[16]  Michael D. Plummer,et al.  On n-extendable graphs , 1980, Discret. Math..