On upper domination Ramsey numbers for graphs.

DOI10.1016/S0012-365X(03)00084-0zbMath1037.05034OpenAlexW2043020651MaRDI QIDQ1421516

Michael A. Henning, Ortrud R. Oellermann

Publication date: 26 January 2004

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

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

zbMATH Keywords

independence numberdominating set

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (1)

Irredundance

Cites Work

• A lower bound for irredundant Ramsey numbers
• Irredundant ramsey numbers for graphs
• On irredundant Ramsey numbers for graphs
• THE IRREDUNDANT RAMSEY NUMBER s(3,6)
• Towards a theory of domination in graphs
• ASYMPTOTIC BOUNDS FOR IRREDUNDANT RAMSEY NUMBERS
• The irredundant ramsey number s(3,3,3) = 13
• The irredundant ramsey number s(3, 7)
• Asymptotic bounds for irredundant and mixed Ramsey numbers
• The upper domination Ramsey number \(u(3,3,3)\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On upper domination Ramsey numbers for graphs.