Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
Authors:
- Elisabeth GaarEGElisabeth Gaar
- Daniel KrennDKDaniel Krenn
- Susan MarguliesSMSusan Margulies
- Angelika WiegeleAWAngelika Wiegele
Open Access
- 1 November 2021
- journal article
- research article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 107, 67-105
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Horizon 2020
- Fulbright Austria
- Austrian Science Fund
This publication has 14 references indexed in Scilit:
- Vizing's conjecture: a survey and recent resultsJournal of Graph Theory, 2011
- Theta Bodies for Polynomial IdealsSIAM Journal on Optimization, 2010
- Algebraic characterization of uniquely vertex colorable graphsJournal of Combinatorial Theory, Series B, 2008
- Nowhere-zero flow polynomialsJournal of Combinatorial Theory, Series A, 2004
- A result on Vizing's conjectureDiscrete Mathematics, 2004
- Complexity of Null- and Positivstellensatz proofsAnnals of Pure and Applied Logic, 2001
- Semidefinite ProgrammingSIAM Review, 1996
- Stable sets and polynomialsDiscrete Mathematics, 1994
- Colorings and orientations of graphsCombinatorica, 1992
- Symmetric polynomials and Hall's theoremDiscrete Mathematics, 1988