2-connected graphs with small 2-connected dominating sets.

DOI10.1016/S0012-365X(03)00055-4zbMath1051.05064OpenAlexW2000987306MaRDI QIDQ1402083

Raphael Yuster, Yair Caro

Publication date: 19 August 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00055-4

zbMATH Keywords

probabilistic methoddomination

Mathematics Subject Classification ID

Combinatorial probability (60C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (4)

Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ 2-edge connected dominating sets and 2-connected dominating sets of a graph ⋮ Connected Domination

Cites Work

• On the ratio of optimal integral and fractional covers
• Transversal numbers of uniform hypergraphs
• Domination in graphs with minimum degree two
• On Hadwiger's Number and the Stability Number
• Connected Domination and Spanning Trees with Many Leaves
• A Winning Strategy for the Ramsey Graph Game
• Unnamed Item
• Unnamed Item

This page was built for publication: 2-connected graphs with small 2-connected dominating sets.