The following pages link to Relaxations of vertex packing (Q1078206):
Displaying 30 items.
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Entropy splitting for antiblocking corners and perfect graphs (Q810528) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Perfect couples of graphs (Q1196687) (← links)
- Stable sets and polynomials (Q1313833) (← links)
- The maximum clique problem (Q1318271) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- The generalized vertex cover problem and some variations (Q1756348) (← links)
- Orthogonal representations and connectivity of graphs (Q1823259) (← links)
- Sandwich theorems and capacity bounds for non-commutative graphs (Q2005181) (← links)
- Probabilistic refinement of the asymptotic spectrum of graphs (Q2064765) (← links)
- Information theoretic parameters of noncommutative graphs and convex corners (Q2152773) (← links)
- Faithful orthogonal representations of graphs from partition logics (Q2156425) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
- A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
- Complementation in T-perfect graphs (Q2672429) (← links)
- A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming (Q2788727) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- The problem of quantum correlations and the totalitarian principle (Q4993417) (← links)
- Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming (Q5013579) (← links)
- Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
- Completing bases in four dimensions (Q5049703) (← links)
- Roots and (Re)sources of Value (In)definiteness Versus Contextuality (Q5119677) (← links)
- $t$-Perfection in $P_5$-Free Graphs (Q5348215) (← links)
- A characterization of the weighted Lovász number based on convex quadratic programming (Q5963688) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- Semi-definite programming and quantum information (Q6561827) (← links)
