t-perfection is always strong for claw-free graphs

DOI10.1137/090769508MaRDI QIDQ3008006zbMATH OpenOpenAlexFDO

Authors Henning Bruhn, Maya 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)

Recommendations

• On claw-free t-perfect graphs
• Claw-free \(t\)-perfect graphs can be recognized in polynomial time
• Claw-free \(t\)-perfect graphs can be recognised in polynomial time
• Characterising claw-free \(t\)-perfect graphs
• Which claw-free graphs are strongly perfect?

Cited in

(11)

• Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs
• The \(\langle t \rangle \)-property of some classes of graphs
• Strongly perfect claw‐free graphs—A short proof
• Strong T-Perfection of Bad-K₄ -Free Graphs
• \(t\)-perfection in \(P_5\)-free graphs
• Which claw-free graphs are strongly perfect?
• Claw-free \(t\)-perfect graphs can be recognised in polynomial time
• 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
• Characterising claw-free \(t\)-perfect graphs

This page was built for publication: \(t\)-perfection is always strong for claw-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3008006)