20 citations · 28 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Sum-of-Squares Certificates for Vizing's Conjecture via Determining Gröbner Bases
Elisabeth Gaar, Melanie Siebenhofer
The famous open Vizing conjecture claims that the domination number of the Cartesian product graph of two graphs and is at least the product of the domination numbers of $G…
math.OC2021★ 6 cited
An SDP-Based Approach for Computing the Stability Number of a Graph
Elisabeth Gaar, Melanie Siebenhofer, Angelika Wiegele
Finding the stability number of a graph, i.e., the maximum number of vertices of which no two are adjacent, is a well known NP-hard combinatorial optimization problem. Since this p…