Paper Info
Title
Claw-free t-perfect graphs can be recognised in polynomial time.
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.
Year
DOI
Venue
2014
10.1137/151006111
SIAM JOURNAL ON DISCRETE MATHEMATICS
Keywords
DocType
Volume
t-perfect graphs,claw-free graphs,induced minors
Conference
30
Issue
ISSN
Citations 
2
0895-4801
1
PageRank 
References 
Authors
0.36
21
2
Name
Order
Citations
PageRank
henning bruhn117724.93
Oliver Schaudt29521.74