Pages that link to "Item:Q1919180"
From MaRDI portal
The following pages link to An upper bound on the independence number of a graph computable in polynomial-time (Q1919180):
Displaying 14 items.
- Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262) (← links)
- Improving an upper bound on the stability number of a graph (Q556012) (← links)
- On hereditary properties of the class of graphs with convex quadratic stability number (Q690543) (← links)
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- The \(k\)-regular induced subgraph problem (Q1786867) (← links)
- Maximum \(k\)-regular induced subgraphs (Q2426653) (← links)
- A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming (Q2788727) (← links)
- Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming (Q5013579) (← links)
- A survey on graphs with convex quadratic stability number (Q5207733) (← links)
- New results for recognizing convex-<i>QP</i> adverse graphs (Q5207738) (← links)
- A quadratic programming approach to the determination of an upper bound on the weighted stability number (Q5939588) (← links)
- A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs (Q5963623) (← links)
- A characterization of the weighted Lovász number based on convex quadratic programming (Q5963688) (← links)
