Claw-free t-perfect graphs can be recognised in polynomial time
Discrete Mathematics
2013-10-31 v1 Computational Complexity
Combinatorics
Abstract
A graph is called t-perfect if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect.
Cite
@article{arxiv.1310.8186,
title = {Claw-free t-perfect graphs can be recognised in polynomial time},
author = {Henning Bruhn and Oliver Schaudt},
journal= {arXiv preprint arXiv:1310.8186},
year = {2013}
}