Some results on Vizing's conjecture and related problems

DOI10.1016/j.dam.2012.06.011zbMath1251.05126OpenAlexW2057526543WikidataQ123241675 ScholiaQ123241675MaRDI QIDQ714041

Michał Pilipczuk, Marcin Pilipczuk, Riste Škrekovski

Publication date: 19 October 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.06.011

zbMATH Keywords

dominating numberVizing's conjectureCartesian product

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (6)

Upper bound on 3-rainbow domination in graphs with minimum degree 2 ⋮ A new framework to approach Vizing's conjecture ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ General upper bounds on independent \(k\)-rainbow domination ⋮ Bounding the \(k\)-rainbow total domination number ⋮ Rainbow Domination in Graphs

Cites Work

• On integer domination in graphs and Vizing-like problems
• Rainbow domination in graphs
• On the \(\{k\}\)-domination number of Cartesian products of graphs
• Fractional domination of strong direct products
• An inequality related to Vizing's conjecture
• Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
• On Vizing's conjecture
• Vizing's conjecture: a survey and recent results
• Domination, Fractional Domination, 2-Packing, and Graph Products
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some results on Vizing's conjecture and related problems