Bruhn, Henning and Schaudt, Oliver (2016). CLAW-FREE t-PERFECT GRAPHS CAN BE RECOGNIZED IN POLYNOMIAL TIME. SIAM Discret. Math., 30 (2). S. 832 - 856. PHILADELPHIA: SIAM PUBLICATIONS. ISSN 1095-7146
Full text not available from this repository.Abstract
A graph is called t-perfect if its stable set polytope is defined by nonnegativity, edge, and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect.
| Item Type: | Journal Article | ||||||||||||
| Creators: |
|
||||||||||||
| URN: | urn:nbn:de:hbz:38-289035 | ||||||||||||
| DOI: | 10.1137/151006111 | ||||||||||||
| Journal or Publication Title: | SIAM Discret. Math. | ||||||||||||
| Volume: | 30 | ||||||||||||
| Number: | 2 | ||||||||||||
| Page Range: | S. 832 - 856 | ||||||||||||
| Date: | 2016 | ||||||||||||
| Publisher: | SIAM PUBLICATIONS | ||||||||||||
| Place of Publication: | PHILADELPHIA | ||||||||||||
| ISSN: | 1095-7146 | ||||||||||||
| Language: | English | ||||||||||||
| Faculty: | Unspecified | ||||||||||||
| Divisions: | Unspecified | ||||||||||||
| Subjects: | no entry | ||||||||||||
| Uncontrolled Keywords: |
|
||||||||||||
| Refereed: | Yes | ||||||||||||
| URI: | http://kups.ub.uni-koeln.de/id/eprint/28903 |
Downloads
Downloads per month over past year
Altmetric
Export
Actions (login required)
 |
View Item |