Strong T-Perfection of Bad-K4 -Free Graphs

DOI10.1137/S0895480101401101MaRDI QIDQ4785692zbMATHFDO

Authors Alexander Schrijver

Publication date 5 January 2003

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

zbMATH Keywords

graphpolytopestable sett-perfect

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Recommendations

• On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs
• scientific article; zbMATH DE number 3902681
• scientific article; zbMATH DE number 733851
• A note on strong perfectness of graphs
• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• The \(P_4\)-structure of perfect graphs
• \(t\)-perfection in \(P_5\)-free graphs
• The strongly perfectness of normal product of \(t\)-perfect graphs
• scientific article; zbMATH DE number 846970
• \(t\)-perfection is always strong for claw-free graphs

Cited in

(4)

• On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs
• Odd-\(K_{4}\)'s in stability critical graphs
• On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
• Claw-free \(t\)-perfect graphs can be recognized in polynomial time

This page was built for publication: Strong T-Perfection of Bad-K₄ -Free Graphs

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