t-Perfection Is Always Strong for Claw-Free Graphs

DOI10.1137/090769508zbMath1236.90097OpenAlexW1990829832MaRDI QIDQ3008006

Henning Bruhn, Maya Jakobine Stein

Publication date: 17 June 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090769508

zbMATH Keywords

claw-freetotally dual integral\(t\)-perfect

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure ⋮ Complementation in T-perfect graphs ⋮ Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time

This page was built for publication: t-Perfection Is Always Strong for Claw-Free Graphs