Stability Critical Graphs and Even Subdivisions of K4
暂无分享,去创建一个
A graph is stability critical (?-critical) if the removal of any edge increases the stability number. We give an affirmative answer to a question raised by Chvaktal, namely, that every connected, critical graph that is neither K2 nor an odd cycle contains an even subdivision of K4
[1] V. Chvátal. On certain polytopes associated with graphs , 1975 .
[2] Leslie E. Trotter,et al. Stability critical graphs and ranks facets of the stable set polytope , 1995, Discret. Math..
[3] E. Sewell. Stability critical graphs and the stable set polytope , 1990 .
[4] Frank Harary,et al. On Indecomposable Graphs , 1967, Canadian Journal of Mathematics.
[5] Andras Hajnal,et al. A Theorem on k-Saturated Graphs , 1965, Canadian Journal of Mathematics.