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

MaRDI QIDQ888596zbMATHFDO

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

dominationVizing'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)

Recommendations

• A result on Vizing's conjecture
• On Vizing's conjecture
• scientific article; zbMATH DE number 140092
• Vizing's conjecture: a survey and recent results
• Vizing's conjecture for chordal graphs

Cites work

• scientific article; zbMATH DE number 3715623 (Why is no real title available?)
• scientific article; zbMATH DE number 1124600 (Why is no real title available?)
• scientific article; zbMATH DE number 3308993 (Why is no real title available?)
• A result on Vizing's conjecture
• An improved inequality related to Vizing's conjecture
• An improvement on Vizing's conjecture
• An inequality related to Vizing's conjecture
• Domination game and an imagination strategy
• Handbook of product graphs
• On domination and independent domination numbers of a graph
• Partial product of graphs and Vizing's conjecture
• Rainbow domination in graphs
• Topics in graph theory. Graphs and their Cartesian product
• Vizing's conjecture: a survey and recent results

Cited in

(18)

• Domination number of modular product graphs
• Total domination in generalized prisms and a new domination invariant
• Vizing's conjecture: A two-thirds bound for claw-free graphs
• On construction for trees making the equality hold in Vizing's conjecture
• A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs
• A note on domination and independence-domination numbers of graphs
• Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
• A result on Vizing's conjecture
• A new framework to approach Vizing's conjecture
• On Vizing's conjecture
• Some improved inequalities related to Vizing's conjecture
• Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases
• Domination in the hierarchical product and Vizing's conjecture
• Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
• (Total) domination in prisms
• Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
• Fair reception and Vizing's conjecture
• scientific article; zbMATH DE number 2197881 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q888596)