The following pages link to Carlos J. Luz (Q194435):
Displaying 17 items.
- Efficient domination through eigenvalues (Q317399) (← links)
- 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)
- (Q690541) (redirect page) (← links)
- Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (Q690542) (← 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)
- A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph (Q1265892) (← links)
- An upper bound on the independence number of a graph computable in polynomial-time (Q1919180) (← links)
- A characterization of the weighted version of McEliece-Rodemich-Rumsey-Schrijver number based on convex quadratic programming (Q2788727) (← links)
- (Q3693289) (← links)
- New results for recognizing convex-<i>QP</i> adverse graphs (Q5207738) (← links)
- A Convex Quadratic Characterization of the Lovász Theta Number (Q5470766) (← links)
- (Q5694562) (← 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)
