The following pages link to Near-perfect matrices (Q1332310):
Displaying 22 items.
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- The stable set polytope of icosahedral graphs (Q898118) (← links)
- On facets of stable set polytopes of claw-free graphs with stability number 3 (Q960958) (← links)
- On packing and covering polyhedra of consecutive ones circulant clutters (Q987683) (← links)
- On the set covering polyhedron of circulant matrices (Q1015320) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← links)
- 2-clique-bond of stable set polyhedra (Q2446841) (← links)
- Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope (Q2448881) (← links)
- On non-rank facets of stable set polytopes of webs with clique number four (Q2492218) (← links)
- On a certain class of nonideal clutters (Q2500534) (← links)
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
- (Q2741357) (← links)
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
- Near-perfect graphs with polyhedral (Q2840742) (← links)
- Characterizing N+-perfect line graphs (Q2968506) (← links)
- Comparing Imperfection Ratio and Imperfection Index for Graph Classes (Q3163670) (← links)
- Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs (Q3195330) (← links)
- Generalized clique family inequalities for claw-free graphs (Q3439487) (← links)
- (Q5708482) (← links)
