Pages that link to "Item:Q2287733"
From MaRDI portal
The following pages link to An improved bound in Vizing's conjecture (Q2287733):
Displayed 5 items.
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- A new framework to approach Vizing's conjecture (Q2656331) (← links)
- On construction for trees making the equality hold in Vizing's conjecture (Q6057635) (← links)
- Domination in digraphs and their direct and Cartesian products (Q6057645) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)