On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs

被引:17
|
作者
Liebling, TM [1 ]
Oriolo, G
Spille, B
Stauffer, G
机构
[1] Ecole Polytech Fed Lausanne, Inst Math, CH-1015 Lausanne, Switzerland
[2] Univ Roma Tor Vergata, Dipartimento Informat Sistemi & Prod, Rome, Italy
[3] Univ Magdeburg, Dept Math IMO, D-39106 Magdeburg, Germany
关键词
stable sets; claw-free graphs; quasi-line graphs; circulant graphs; clique family inequalities;
D O I
10.1007/s001860300317
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend results of Giles and Trotter [7] by (i) showing that for any nonnegative integer a there exists a circulant graph whose stable set polytope has a facet-inducing inequality with (a,a+1)-valued coefficients (rank facets have only coefficients 0, 1), and (ii) providing new facets of the stable set polytope with up to five different non-zero coefficients for claw-free graphs. We prove that coefficients have to be consecutive in any facet with exactly two different non-zero coefficients (assuming they are relatively prime). Last but not least, we present a complete description of the stable set polytope for graphs with stability number 2, already observed by Cook [3] and Shepherd [18].
引用
收藏
页码:25 / 35
页数:11
相关论文
共 50 条
  • [1] On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
    Thomas M. Liebling
    Gianpaolo Oriolo
    Bianca Spille
    Gautier Stauffer
    [J]. Mathematical Methods of Operations Research, 2004, 59 : 25 - 35
  • [2] The rank facets of the stable set polytope for claw-free graphs
    Galluccio, A
    Sassano, A
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1997, 69 (01) : 1 - 38
  • [3] On the stable set polytope of claw-free graphs
    Galluccio, Anna
    Gentile, Claudio
    Ventura, Paolo
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2008, 5165 : 339 - 350
  • [4] Some classical combinatorial problems on circulant and claw-free graphs: the isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs
    Pietropaoli, Ugo
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2009, 7 (03): : 297 - 300
  • [5] Some classical combinatorial problems on circulant and claw-free graphs: the isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs
    Ugo Pietropaoli
    [J]. 4OR, 2009, 7 : 297 - 300
  • [6] On facets of stable set polytopes of claw-free graphs with stability number 3
    Pecher, Arnaud
    Wagler, Annegret K.
    [J]. DISCRETE MATHEMATICS, 2010, 310 (03) : 493 - 498
  • [7] The stable set polytope of claw-free graphs with stability number greater than three
    Galluccio, Anna
    Gentile, Claudio
    Ventura, Paolo
    [J]. OPERATIONS RESEARCH PROCEEDINGS 2011, 2012, : 47 - 52
  • [8] On stable cutsets in claw-free graphs and planar graphs
    Le, Van Bang
    Mosca, Raffaele
    Muller, Haiko
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (02) : 256 - 276
  • [9] The generalized stable set problem for claw-free bidirected graphs
    Nakamura, D
    Tamura, A
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 69 - 83
  • [10] Lov?sz-Schrijver PSD-operator and the stable set polytope of claw-free graphs
    Bianchi, Silvia M.
    Escalante, Mariana S.
    Nasini, Graciela L.
    Wagler, Annegret K.
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 332 : 70 - 86