On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
type: Item
instance of: scholarly article
title: On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
zbMATH Open document ID: 1479.05126
author: Annegret K. Wagler
published in: Discrete Applied Mathematics
publication date: 2022-01-05T00:00:00Z
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7452367
zbMATH Keywords: stable set polytope
zbMATH Keywords: \( L S_+\)-perfect graphs
zbMATH Keywords: graph classes defined by clique cutsets
MaRDI profile type: Publication
full work available at URL: j.dam.2019.07.017
OpenAlex ID: W2966689362
cites work: Near-perfect graphs with polyhedral \(N_+(G)\)
cites work: Lovász-Schrijver PSD-Operator on Claw-Free Graphs
cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\)
cites work: Clique‐cutsets beyond chordal graphs
cites work: On claw-free \(t\)-perfect graphs
cites work: The strong perfect graph theorem
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: On certain polytopes associated with graphs
cites work: Q4165164
cites work: Universally signable graphs
cites work: Characterizing and bounding the imperfection ratio for some classes of graphs
cites work: On rigid circuit graphs
cites work: Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs
cites work: Characterizing N+-perfect line graphs
cites work: Split Graphs Having Dilworth Number Two
cites work: The stable set problem and the lift-and-project ranks of graphs
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Three-colourability and forbidden subgraphs. II: Polynomial algorithms
cites work: Applying Lehman's theorems to packing problems
cites work: Alpha-balanced graphs and matrices and GF(3)-representability of matroids
cites work: Antiwebs are rank-perfect
cites work: Lovász-Schrijver PSD-operator on some graph classes defined by clique cutsets
DOI: 10.1016/J.DAM.2019.07.017
Recommended article: Lovász-Schrijver PSD-operator on some graph classes defined by clique cutsets
Recommended article: Lovász-Schrijver PSD-Operator on Claw-Free Graphs
Recommended article: Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
Recommended article: Clique‐cutsets beyond chordal graphs
Recommended article: Clique cutsets beyond chordal graphs
Recommended article: Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
Recommended article: Copositivity cuts for improving SDP bounds on the clique number
Recommended article: Q4810366
Recommended article: Multicut on Graphs of Bounded Clique-Width
Recommended article: The clique operator on graphs with few \(P_{4}\)'s
description: scientific article; zbMATH DE number 7452367