A 34-approximation of Vizing's conjecture for claw-free graphs
From MaRDI portal
Publication:777412
Recommendations
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- 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 note on domination and independence-domination numbers of graphs
- A result on Vizing's conjecture
- An improved inequality related to Vizing's conjecture
- An inequality related to Vizing's conjecture
- Domination in the hierarchical product and Vizing's conjecture
- Fair reception and Vizing's conjecture
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
- On domination and independent domination numbers of a graph
- Partial product of graphs and Vizing's conjecture
- Vizing's conjecture and the one-half argument
- Vizing's conjecture for chordal graphs
- Vizing's conjecture for graphs with domination number 3 -- a new proof
- Vizing's conjecture: A two-thirds bound for claw-free graphs
- Vizing's conjecture: a survey and recent results
Cited in
(2)
This page was built for publication: A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777412)