On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
From MaRDI portal
Publication:2064297
DOI10.1016/j.dam.2019.07.017zbMath1479.05126OpenAlexW2966689362MaRDI QIDQ2064297
Publication date: 5 January 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.07.017
Programming involving graphs or networks (90C35) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)
Related Items
Cites Work
- Unnamed Item
- On claw-free \(t\)-perfect graphs
- On rigid circuit graphs
- The strong perfect graph theorem
- Characterizing and bounding the imperfection ratio for some classes of graphs
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Universally signable graphs
- On certain polytopes associated with graphs
- The stable set problem and the lift-and-project ranks of graphs
- Three-colourability and forbidden subgraphs. II: Polynomial algorithms
- Lovász-Schrijver PSD-operator on some graph classes defined by clique cutsets
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Antiwebs are rank-perfect
- Applying Lehman's theorems to packing problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs
- Near-perfect graphs with polyhedral
- Characterizing N+-perfect line graphs
- Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Split Graphs Having Dilworth Number Two
- Clique‐cutsets beyond chordal graphs
