Pages that link to "Item:Q1919808"
From MaRDI portal
The following pages link to Applying Lehman's theorems to packing problems (Q1919808):
Displaying 32 items.
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs (Q299078) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- On circulant thin Lehman matrices (Q484160) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- Clique-circulants and the stable set polytope of fuzzy circular interval graphs (Q948961) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- A note on kernels and Sperner's Lemma (Q967389) (← links)
- On packing and covering polyhedra of consecutive ones circulant clutters (Q987683) (← links)
- Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- Non-regular square bipartite designs (Q1601620) (← links)
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets (Q2064297) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
- Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope (Q2448881) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- On the commutativity of antiblocker diagrams under lift-and-project operators (Q2500533) (← links)
- On a certain class of nonideal clutters (Q2500534) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Complementation in T-perfect graphs (Q2672429) (← links)
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
- Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (Q2804992) (← links)
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
- Some advances on Lovász-Schrijver relaxations of the fractional stable set polytope (Q2840707) (← links)
- Near-perfect graphs with polyhedral (Q2840742) (← links)
- (Q2857444) (← links)
- Characterizing N+-perfect line graphs (Q2968506) (← links)
- Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs (Q3195330) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- $t$-Perfection in $P_5$-Free Graphs (Q5348215) (← links)
- (Q5708482) (← links)
