2000 character limit reached
Claw-free t-perfect graphs can be recognised in polynomial time
Published 30 Oct 2013 in cs.DM, cs.CC, and math.CO | (1310.8186v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
