Vizing's conjecture for chordal graphs
From MaRDI portal
Publication:1024500
DOI10.1016/J.DISC.2008.02.025zbMATH Open1211.05098OpenAlexW2028178319WikidataQ123310236 ScholiaQ123310236MaRDI QIDQ1024500FDOQ1024500
Authors: Ron Aharoni, Tibor Szabó 
Publication date: 17 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.025
Recommendations
Cites Work
- Title not available (Why is that?)
- Kneser's conjecture, chromatic number, and homotopy
- Title not available (Why is that?)
- Hall's theorem for hypergraphs
- A tree version of Kőnig's theorem
- An inequality related to Vizing's conjecture
- The clique complex and hypergraph matching
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A result on Vizing's conjecture
Cited In (10)
- Equality in Vising's conjecture fixing one factor of the cartesian product.
- Vizing's conjecture: a survey and recent results
- A note on domination and independence-domination numbers of graphs
- On construction for trees making the equality hold in Vizing's conjecture
- Fair reception and Vizing's conjecture
- Title not available (Why is that?)
- A new framework to approach Vizing's conjecture
- A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs
- Some improved inequalities related to Vizing's conjecture
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
This page was built for publication: Vizing's conjecture for chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024500)
