$t$-Perfection in $P_5$-Free Graphs

DOI10.1137/16M1059874zbMath1368.05044arXiv1507.00173MaRDI QIDQ5348215

Henning Bruhn, Elke Fuchs

Publication date: 14 August 2017

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

Full work available at URL: https://arxiv.org/abs/1507.00173

zbMATH Keywords

stable set polytopenear-bipartiteantiweb\(P_5\)-free

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Perfect graphs (05C17)

Related Items (1)

Complementation in T-perfect graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On claw-free \(t\)-perfect graphs
• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• The strong perfect graph theorem
• \(K_{4}\)-free graphs with no odd holes
• Relaxations of vertex packing
• Polytope des independants d'un graphe série-parallèle
• Geometric algorithms and combinatorial optimization
• A class of facet producing graphs for vertex packing polyhedra
• Critical perfect graphs and perfect 3-chromatic graphs
• On certain polytopes associated with graphs
• The stable set polytope and some operations on graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Antiwebs are rank-perfect
• Applying Lehman's theorems to packing problems
• On rank-perfect subclasses of near-bipartite graphs
• Anti-blocking polyhedra
• On the Chvátal rank of linear relaxations of the stable set polytope
• Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
• A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
• Transformations which Preserve Perfectness and H-Perfectness of Graphs
• The Graphs with All Subgraphs T-Perfect
• Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor
• On $3$-Colorable $P_5$-Free Graphs

This page was built for publication: $t$-Perfection in $P_5$-Free Graphs