Vizing's conjecture for chordal graphs

DOI10.1016/j.disc.2008.02.025zbMath1211.05098OpenAlexW2028178319WikidataQ123310236 ScholiaQ123310236MaRDI QIDQ1024500

Tibor Szabó, Ron Aharoni

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

zbMATH Keywords

graph theoryVizing's conjecturedomination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

A new framework to approach Vizing's conjecture ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Some improved inequalities related to Vizing's conjecture ⋮ Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs ⋮ Fair reception and Vizing's conjecture ⋮ A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs ⋮ Vizing's conjecture: a survey and recent results

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• The clique complex and hypergraph matching
• A result on Vizing's conjecture
• An inequality related to Vizing's conjecture
• A tree version of Kőnig's theorem
• Hall's theorem for hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vizing's conjecture for chordal graphs