Vizing's conjecture for graphs with domination number 3 -- a new proof

zbMath1323.05099MaRDI QIDQ888596

Boštjan Brešar

Publication date: 2 November 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i3p38

zbMATH Keywords

Vizing's conjectureCartesian productdomination

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 (8)

Vizing's conjecture: A two-thirds bound for claw-free graphs ⋮ A new framework to approach Vizing's conjecture ⋮ Domination in the hierarchical product and Vizing's conjecture ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Some improved inequalities related to Vizing's conjecture ⋮ (Total) domination in prisms ⋮ Total domination in generalized prisms and a new domination invariant ⋮ A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved inequality related to Vizing's conjecture
• On domination and independent domination numbers of a graph
• Rainbow domination in graphs
• A result on Vizing's conjecture
• An inequality related to Vizing's conjecture
• An improvement on Vizing's conjecture
• Domination Game and an Imagination Strategy
• Vizing's conjecture: a survey and recent results
• Partial product of graphs and Vizing's conjecture

This page was built for publication: Vizing's conjecture for graphs with domination number 3 -- a new proof