A result on Vizing's conjecture

DOI10.1016/j.disc.2003.09.003zbMath1030.05087OpenAlexW2091200007WikidataQ122977822 ScholiaQ122977822MaRDI QIDQ1420620

Liang Sun

Publication date: 2 February 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.09.003

zbMATH Keywords

Cartesian productGraphDomination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (13)

Vizing's conjecture: A two-thirds bound for claw-free graphs ⋮ A new framework to approach Vizing's conjecture ⋮ On the domination number of the Cartesian product of the cycle of length \(n\) and any graph ⋮ Domination in the hierarchical product and Vizing's conjecture ⋮ Vizing's conjecture for graphs with domination number 3 -- a new proof ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Some improved inequalities related to Vizing's conjecture ⋮ Alliance free sets in Cartesian product graphs ⋮ Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares ⋮ Fair reception and Vizing's conjecture ⋮ Vizing's conjecture for chordal graphs ⋮ A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs ⋮ Vizing's conjecture: a survey and recent results

Cites Work

• On Vizing's conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A result on Vizing's conjecture