Vizing's conjecture: a survey and recent results
From MaRDI portal
Publication:3113279
DOI10.1002/jgt.20565zbMath1234.05173OpenAlexW1990941137WikidataQ55969527 ScholiaQ55969527MaRDI QIDQ3113279
Michael A. Henning, Boštjan Brešar, Paul Dorbec, Sandi Klavžar, Douglas F. Rall, Wayne Goddard, Bert L. Hartnell
Publication date: 8 February 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20565
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Distance formula for direct-co-direct product in the case of disconnected factors ⋮ Grundy domination of forests and the strong product conjecture ⋮ Connectivity and other invariants of generalized products of graphs ⋮ On total domination in the Cartesian product of graphs ⋮ On the 2-domination Number of Cylinders with Small Cycles ⋮ Vizing's conjecture: A two-thirds bound for claw-free graphs ⋮ A new framework to approach Vizing's conjecture ⋮ Protection of graphs with emphasis on Cartesian product graphs ⋮ Cartesian product graphs and k-tuple total domination ⋮ Prime factorization and domination in the hierarchical product of graphs ⋮ Total \(\{k\}\)-domination in special graphs ⋮ Vizing's conjecture for graphs with domination number 3 -- a new proof ⋮ A note on total and paired domination of Cartesian product graphs ⋮ Laplacian distribution and domination ⋮ Categorifying connected domination via graph überhomology ⋮ Bounds On $(t,r)$ Broadcast Domination of $n$-Dimensional Grids ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Domination in digraphs and their direct and Cartesian products ⋮ Total Roman domination in the lexicographic product of graphs ⋮ The 2-domination number of cylindrical graphs ⋮ (Open) packing number of some graph products ⋮ On some metric properties of direct-co-direct product ⋮ Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases ⋮ Sketchy tweets: ten minute conjectures in graph theory ⋮ Some improved inequalities related to Vizing's conjecture ⋮ On Grundy total domination number in product graphs ⋮ Alliance free sets in Cartesian product graphs ⋮ A Vizing-type result for semi-total domination ⋮ On Cartesian products having a minimum dominating set that is a box or a stairway ⋮ Domatically perfect graphs ⋮ Dominating sequences in grid-like and toroidal graphs ⋮ (Total) domination in prisms ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Dominating sets in intersection graphs of finite groups ⋮ Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs ⋮ Some results on Vizing's conjecture and related problems ⋮ Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares ⋮ Bounding the \(k\)-rainbow total domination number ⋮ An improved bound in Vizing's conjecture ⋮ Tightness of domination inequalities for direct product graphs ⋮ Total domination in generalized prisms and a new domination invariant ⋮ Paired Domination in Graphs ⋮ Multiple Domination ⋮ Rainbow Domination in Graphs ⋮ 3-tuple total domination number of Rook's graphs ⋮ A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs ⋮ On Clark and Suen bound-type results fork-domination and Roman domination of Cartesian product graphs ⋮ My Top 10 Graph Theory Conjectures and Open Problems ⋮ Integer domination of Cartesian product graphs ⋮ On eternal domination and Vizing-type inequalities ⋮ Orientable domination in product-like graphs ⋮ Connected domination game played on Cartesian products
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination dot-critical graphs
- On the upper total domination number of Cartesian products of graphs
- Vizing's conjecture for chordal graphs
- On the \(\{k\}\)-domination number of Cartesian products of graphs
- On the total \(\{k\}\)-domination number of Cartesian products of graphs
- Relations between packing and covering numbers of a tree
- Fractional domination of strong direct products
- A result on Vizing's conjecture
- An inequality related to Vizing's conjecture
- On the total domination number of Cartesian products of graphs
- A tree version of Kőnig's theorem
- On Vizing's conjecture
- Associative graph products and their independence, domination and coloring numbers
- Fair reception and Vizing's conjecture
- On the domination of the products of graphs II: Trees
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- Vertices contained in every minimum dominating set of a tree
- Domination, Fractional Domination, 2-Packing, and Graph Products
- Paired-domination in graphs
- Improving some bounds for dominating Cartesian products
- A partition approach to Vizing's conjecture
- Vizing's conjecture and the one-half argument
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
