Pages that link to "Item:Q3113279"
From MaRDI portal
The following pages link to Vizing's conjecture: a survey and recent results (Q3113279):
Displayed 30 items.
- Connectivity and other invariants of generalized products of graphs (Q313405) (← links)
- A note on total and paired domination of Cartesian product graphs (Q396841) (← links)
- On Cartesian products having a minimum dominating set that is a box or a stairway (Q497315) (← links)
- Dominating sequences in grid-like and toroidal graphs (Q504964) (← links)
- (Total) domination in prisms (Q510330) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← 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)
- Grundy domination of forests and the strong product conjecture (Q831340) (← links)
- Vizing's conjecture for graphs with domination number 3 -- a new proof (Q888596) (← links)
- On total domination in the Cartesian product of graphs (Q1656910) (← links)
- Laplacian distribution and domination (Q1684945) (← links)
- Some improved inequalities related to Vizing's conjecture (Q1708275) (← links)
- A Vizing-type result for semi-total domination (Q1732092) (← links)
- Dominating sets in intersection graphs of finite groups (Q1755474) (← links)
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs (Q2012524) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- Bounding the \(k\)-rainbow total domination number (Q2032845) (← links)
- On Grundy total domination number in product graphs (Q2214319) (← links)
- An improved bound in Vizing's conjecture (Q2287733) (← links)
- Integer domination of Cartesian product graphs (Q2339441) (← links)
- Vizing's conjecture: A two-thirds bound for claw-free graphs (Q2399303) (← links)
- Prime factorization and domination in the hierarchical product of graphs (Q2409781) (← links)
- Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
- Sketchy tweets: ten minute conjectures in graph theory (Q2429454) (← links)
- Alliance free sets in Cartesian product graphs (Q2446344) (← links)
- A new framework to approach Vizing's conjecture (Q2656331) (← links)
- On Clark and Suen bound-type results for<i>k</i>-domination and Roman domination of Cartesian product graphs (Q2852110) (← links)
- (Open) packing number of some graph products (Q3386621) (← links)
- My Top 10 Graph Theory Conjectures and Open Problems (Q5506779) (← links)