Name
Abstract | ||
|---|---|---|
A connected graph G is called t-perfect if its stable set polytope is determined by the nonnegativity, edge, and odd-cycle inequalities. Moreover, G is called strongly t-perfect if this system is totally dual integral. It is an open problem whether t-perfection is equivalent to strong t-perfection. We prove the equivalence for the class of claw-free graphs. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1137/090769508 | SIAM JOURNAL ON DISCRETE MATHEMATICS |
Keywords | Field | DocType |
t-perfect,claw-free,totally dual integral | Claw,Discrete mathematics,Combinatorics,Open problem,Claw-free graph,Polytope,Equivalence (measure theory),Independent set,Equivalence class,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
24 | 3 | 0895-4801 |
Citations | PageRank | References |
2 | 0.36 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| henning bruhn | 1 | 177 | 24.93 |
| maya stein | 2 | 81 | 15.65 |