König-Egerváry graphs, 2-bicritical graphs and fractional matchings
暂无分享,去创建一个
[1] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[2] C. Berge,et al. Minimax Theorems for Normal Hypergraphs and Balanced Hypergraphs — A Survey , 1984 .
[3] Peter L. Hammer,et al. Node-weighted graphs having the König-Egerváry property , 1984 .
[4] László Lovász,et al. Ear-decompositions of matching-covered graphs , 1983, Comb..
[5] William R. Pulleyblank. Minimum node covers and 2-bicritical graphs , 1979, Math. Program..
[6] P. Hammer,et al. Vertices Belonging to All or to No Maximum Stable Sets of a Graph , 1982 .
[7] J. C. Picard,et al. On the integer-valued variables in the linear vertex packing problem , 1977, Math. Program..
[8] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[9] F Stersoul,et al. A characterization of the graphs in which the transversal number equals the matching number , 1979, J. Comb. Theory, Ser. B.
[10] Robert W. Deming,et al. Independence numbers of graphs-an extension of the Koenig-Egervary theorem , 1979, Discret. Math..