The following pages link to A result on Vizing's conjecture (Q1420620):
Displaying 25 items.
- A short proof of a result on a Vizing-like problem for integer total domination (Q604746) (← links)
- Some results on Vizing's conjecture and related problems (Q714041) (← links)
- A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs (Q777412) (← links)
- On the domination number of the Cartesian product of the cycle of length \(n\) and any graph (Q869572) (← links)
- Vizing's conjecture for graphs with domination number 3 -- a new proof (Q888596) (← links)
- A new proof of Vázsonyi's conjecture (Q942175) (← links)
- Vizing's conjecture for chordal graphs (Q1024500) (← links)
- An inequality related to Vizing's conjecture (Q1568837) (← links)
- Some improved inequalities related to Vizing's conjecture (Q1708275) (← links)
- An improvement on Vizing's conjecture (Q1943620) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- An improved bound in Vizing's conjecture (Q2287733) (← 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)
- Alliance free sets in Cartesian product graphs (Q2446344) (← 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)
- Vizing's conjecture: a survey and recent results (Q3113279) (← links)
- Fair reception and Vizing's conjecture (Q3633006) (← links)
- (Q3726134) (← links)
- (Q4028467) (← links)
- A partition approach to Vizing's conjecture (Q4862114) (← links)
- A Class of Graphs Approaching Vizing's Conjecture (Q5225521) (← links)
- On construction for trees making the equality hold in Vizing's conjecture (Q6057635) (← links)
