Combinatorial properties of the family of maximum stable sets of a graph
暂无分享,去创建一个
[1] Vadim E. Levit,et al. On the structure of ?-stable graphs , 2001, Discret. Math..
[2] P. Hammer,et al. Vertices Belonging to All or to No Maximum Stable Sets of a Graph , 1982 .
[3] G. Tinhofer. Graphen und Matrizen , 1976 .
[4] Douglas F. Rall,et al. Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion , 1993, Discret. Appl. Math..
[5] Claude Berge,et al. Some common properties for regulizable graphs, edge-critical graphs and B-graphs , 1980, Graph Theory and Algorithms.
[6] F Stersoul,et al. A characterization of the graphs in which the transversal number equals the matching number , 1979, J. Comb. Theory, Ser. B.
[7] Robert W. Deming,et al. Independence numbers of graphs-an extension of the Koenig-Egervary theorem , 1979, Discret. Math..
[8] Vadim E. Levit,et al. On + -stable K#onig-Egerv&ary graphs , 2003 .
[9] Bolian Liu,et al. Combinatorial Properties of Matrices , 2000 .
[10] Vadim E. Levit,et al. C O ] 2 D ec 1 99 9 On α +-Stable König-Egervary Graphs , 1999 .
[11] Vadim E. Levit,et al. On alpha+-stable Ko"nig-Egerváry graphs , 2003, Discret. Math..
[12] Jennifer S. Zito. The structure and maximum number of maximum independent sets in trees , 1991, J. Graph Theory.
[13] C. Berge. Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs , 1982 .