arXiv:1612.02670 [math.CO]AbstractReferencesReviewsResources
Lovász-Schrijver PSD-operator on Claw-Free Graphs
Silvia Bianchi, Mariana Escalante, Graciela Nasini, Annegret Wagler
Published 2016-12-06Version 1
The subject of this work is the study of $\LS_+$-perfect graphs defined as those graphs $G$ for which the stable set polytope $\stab(G)$ is achieved in one iteration of Lov\'asz-Schrijver PSD-operator $\LS_+$, applied to its edge relaxation $\estab(G)$. In particular, we look for a polyhedral relaxation of $\stab(G)$ that coincides with $\LS_+(\estab(G))$ and $\stab(G)$ if and only if $G$ is $\LS_+$-perfect. An according conjecture has been recently formulated ($\LS_+$-Perfect Graph Conjecture); here we verify it for the well-studied class of claw-free graphs.
Related articles: Most relevant | Search more
arXiv:2107.04837 [math.CO] (Published 2021-07-10)
Connected $k$-partition of $k$-connected graphs and $c$-claw-free graphs
arXiv:2502.07339 [math.CO] (Published 2025-02-11)
Spanning trees of claw-free graphs with few leaves and branch vertices
arXiv:2010.14273 [math.CO] (Published 2020-10-27)
$1/2$-conjectures on the domination game and claw-free graphs