On irredundant Ramsey numbers for graphs
From MaRDI portal
Publication:3484871
DOI10.1002/jgt.3190140407zbMath0705.05048OpenAlexW2032666781MaRDI QIDQ3484871
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140407
Related Items
Irredundance perfect graphs, ASYMPTOTIC BOUNDS FOR IRREDUNDANT RAMSEY NUMBERS, The irredundant ramsey number s(3,3,3) = 13, On upper domination Ramsey numbers for graphs.