Pages that link to "Item:Q888596"
From MaRDI portal
The following pages link to Vizing's conjecture for graphs with domination number 3 -- a new proof (Q888596):
Displaying 17 items.
- (Total) domination in prisms (Q510330) (← links)
- A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs (Q777412) (← links)
- A result on Vizing's conjecture (Q1420620) (← links)
- Some improved inequalities related to Vizing's conjecture (Q1708275) (← links)
- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three (Q1878591) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- Total domination in generalized prisms and a new domination invariant (Q2042628) (← links)
- Vizing's conjecture: A two-thirds bound for claw-free graphs (Q2399303) (← links)
- Domination in the hierarchical product and Vizing's conjecture (Q2411590) (← links)
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof (Q2571305) (← links)
- A new framework to approach Vizing's conjecture (Q2656331) (← links)
- On Vizing's conjecture (Q2773039) (← links)
- A note on domination and independence-domination numbers of graphs (Q2925428) (← links)
- Fair reception and Vizing's conjecture (Q3633006) (← links)
- On construction for trees making the equality hold in Vizing's conjecture (Q6057635) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)
- Domination number of modular product graphs (Q6659779) (← links)
