arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.00173math.CO
收藏

无$P_5$图的$t$ -完美性

$t$-perfection in $P_5$-free graphs

Henning Bruhn, Elke Fuchs

摘要:

一个图称为$t$ -完美图,如果它的独立集多面体完全由非负性、边和奇圈约束描述.我们利用禁止的$t$-子图来构造无$P_5$的$t$ -完美图.此外,我们表明,$P_5$ -免费的$t$ -完美的图总是可以用三种颜色着色,并且它们可以在多项式时间内识别。

英文摘要:

A graph is called $t$-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise $P_5$-free $t$-perfect graphs in terms of forbidden $t$-minors. Moreover, we show that $P_5$-free $t$-perfect graphs can always be coloured with three colours, and that they can be recognised in polynomial time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑