$t$-perfection in $P_5$-free graphs
Combinatorics
2016-10-24 v2
Abstract
A graph is called -perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise -free -perfect graphs in terms of forbidden -minors. Moreover, we show that -free -perfect graphs can always be coloured with three colours, and that they can be recognised in polynomial time.
Keywords
Cite
@article{arxiv.1507.00173,
title = {$t$-perfection in $P_5$-free graphs},
author = {Henning Bruhn and Elke Fuchs},
journal= {arXiv preprint arXiv:1507.00173},
year = {2016}
}
Comments
Work of Holm et al of which we were not aware made some parts unnecessary. This concerns mostly the section on near-bipartite graphs that is much shorter now