메뉴 건너뛰기




Volumn 21, Issue 1, 2001, Pages 61-88

Critical facets of the stable set polytope

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0035628935     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930170005     Document Type: Article
Times cited : (13)

References (14)
  • 1
    • 29244468770 scopus 로고
    • On critical graphs
    • Theory of Graphs, held at Rome, Dunod, Paris, Gordon and Breach, New York
    • B. ANDRÁSFAI: On critical graphs, in: Theory of Graphs, International symposium held at Rome, 1966, Dunod, Paris, Gordon and Breach, New York, 1967, 9-19.
    • (1966) International Symposium , pp. 9-19
    • Andrásfai, B.1
  • 2
    • 0000181965 scopus 로고
    • Compositions of graphs and polyhedra II: Stable sets
    • F. BARAHONA and A.R. MAHJOUB: Compositions of graphs and polyhedra II: stable sets, SIAM J. Discrete Math. 7 (1994) 359-371.
    • (1994) SIAM J. Discrete Math. , vol.7 , pp. 359-371
    • Barahona, F.1    Mahjoub, A.R.2
  • 3
    • 0002716241 scopus 로고
    • On certain polytopes associated with graphs
    • V. CHVÁTAL: On certain polytopes associated with graphs, J. Combin. Theory Ser. B 18 (1975), 138-154.
    • (1975) J. Combin. Theory Ser. B , vol.18 , pp. 138-154
    • Chvátal, V.1
  • 4
    • 0040263564 scopus 로고
    • On the minimal number of nodes representing the edges of a graph
    • P. ERDOS and T. GALLAI: On the minimal number of nodes representing the edges of a graph, Magyar Tud. Akad. Mat. Kutató Int. Közl. 6 (1961) 181-203.
    • (1961) Magyar Tud. Akad. Mat. Kutató Int. Közl. , vol.6 , pp. 181-203
    • Erdos, P.1    Gallai, T.2
  • 5
    • 0040901619 scopus 로고
    • A theorem on k-saturated graphs
    • A. HAJNAL: A theorem on k-saturated graphs, Canad. J. Math. 17 (1965) 720-724.
    • (1965) Canad. J. Math. , vol.17 , pp. 720-724
    • Hajnal, A.1
  • 6
    • 24844472329 scopus 로고    scopus 로고
    • Facets with fixed defect of the stable set polytope
    • to appear
    • L. LIPTÁK and L. LOVÁSZ: Facets with fixed defect of the stable set polytope, to appear in Math. Programming.
    • Math. Programming
    • Lipták, L.1    Lovász, L.2
  • 7
    • 4243589561 scopus 로고
    • Some finite basis theorems in graph theory
    • Combinatorics (eds.: A. Hajnal and V. T. Sós), North-Holland, Amsterdam
    • L. LOVÁSZ: Some finite basis theorems in graph theory, in: Combinatorics (eds.: A. Hajnal and V. T. Sós), Colloq. Math. Soc. János Bolyai 18, North-Holland, Amsterdam, 1978, 717-729.
    • (1978) Colloq. Math. Soc. János Bolyai , vol.18 , pp. 717-729
    • Lovász, L.1
  • 8
    • 0038363049 scopus 로고
    • Akadémiai Kiadó, Budapest; North-Holland, Amsterdam
    • L. LOVÁSZ and M. D. PLUMMER: Matching Theory, Akadémiai Kiadó, Budapest; North-Holland, Amsterdam, 1986.
    • (1986) Matching Theory
    • Lovász, L.1    Plummer, M.D.2
  • 10
    • 0023863806 scopus 로고
    • On the stable set polytope of a series-parallel graph
    • A. R. MAHJOUB: On the Stable Set Polytope of a Series-Parallel Graph, Mathematical Programming 40, (1988), 53-57.
    • (1988) Mathematical Programming , vol.40 , pp. 53-57
    • Mahjoub, A.R.1
  • 13
    • 24844469699 scopus 로고
    • On line critical graphs
    • Infinite and Finite Sets (eds. A. Hajnal, R. Rado and V. T. Sós), North-Holland, Amsterdam
    • L. SURÁNYI: On line critical graphs, in: Infinite and Finite Sets (eds. A. Hajnal, R. Rado and V. T. Sós), Coll. Math. Soc. J. Bolyai 10 North-Holland, Amsterdam, 1975, 1411-1444.
    • (1975) Coll. Math. Soc. J. Bolyai , vol.10 , pp. 1411-1444
    • Surányi, L.1
  • 14
    • 0000646211 scopus 로고
    • Further facet generating procedures for vertex packing polytopes
    • L. A. WOLSEY: Further facet generating procedures for vertex packing polytopes, Mathematical Programming, 11 (1976) 158-163.
    • (1976) Mathematical Programming , vol.11 , pp. 158-163
    • Wolsey, L.A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.