Vizing's conjecture for graphs with domination number 3 -- a new proof
zbMATH Open1323.05099MaRDI QIDQ888596FDOQ888596
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Domination Game and an Imagination Strategy
- Rainbow domination in graphs
- On domination and independent domination numbers of a graph
- Title not available (Why is that?)
- Topics in graph theory. Graphs and their Cartesian product
- Vizing's conjecture: a survey and recent results
- An inequality related to Vizing's conjecture
- An improved inequality related to Vizing's conjecture
- Title not available (Why is that?)
- Partial product of graphs and Vizing's conjecture
- Title not available (Why is that?)
- A result on Vizing's conjecture
- An improvement on Vizing's conjecture
Cited In (16)
- Domination in the hierarchical product and Vizing's conjecture
- Title not available (Why is that?)
- On construction for trees making the equality hold in Vizing's conjecture
- Fair reception and Vizing's conjecture
- On Vizing's conjecture
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases
- Total domination in generalized prisms and a new domination invariant
- A new framework to approach Vizing's conjecture
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
- A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs
- Domination number of modular product graphs
- Vizing's conjecture: A two-thirds bound for claw-free graphs
- A result on Vizing's conjecture
- (Total) domination in prisms
- Some improved inequalities related to Vizing's conjecture
- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
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)
