Pages that link to "Item:Q2029005"
From MaRDI portal
The following pages link to Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005):
Displaying 8 items.
- An algebraic exploration of dominating sets and Vizing's conjecture (Q426851) (← links)
- High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts (Q2401179) (← links)
- The 2-domination number of cylindrical graphs (Q2678854) (← links)
- An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture (Q5120487) (← links)
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts (Q5853720) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)
