Recommendations
Cites work
- scientific article; zbMATH DE number 3715623 (Why is no real title available?)
- scientific article; zbMATH DE number 140092 (Why is no real title available?)
- scientific article; zbMATH DE number 1124600 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 2197881 (Why is no real title available?)
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- A result on Vizing's conjecture
- A tree version of Kőnig's theorem
- An inequality related to Vizing's conjecture
- Hall's theorem for hypergraphs
- Kneser's conjecture, chromatic number, and homotopy
- The clique complex and hypergraph matching
Cited in
(11)- Equality in Vising's conjecture fixing one factor of the cartesian product.
- 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
- scientific article; zbMATH DE number 1278821 (Why is no real title available?)
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
- Vizing's conjecture for graphs with domination number 3 -- a new proof
- A new framework to approach Vizing's conjecture
- Some improved inequalities related to Vizing's conjecture
- Fair reception and Vizing's conjecture
- Vizing's conjecture: a survey and recent results
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)
