CO-irredundant Ramsey numbers for graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200008)34:4<258::AID-JGT2>3.0.CO;2-4" /><258::AID-JGT2>3.0.CO;2-4 10.1002/1097-0118(200008)34:4<258::AID-JGT2>3.0.CO;2-4zbMath0958.05092OpenAlexW4245865481MaRDI QIDQ4506066

No author found.

Publication date: 30 March 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200008)34:4<258::aid-jgt2>3.0.co;2-4

zbMATH Keywords

graph Ramsey numberCO-irredundant

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (2)

A lower bound for the CO-irredundance number of a graph ⋮ Irredundance

Cites Work

• THE IRREDUNDANT RAMSEY NUMBER s(3,6)
• ASYMPTOTIC BOUNDS FOR IRREDUNDANT RAMSEY NUMBERS
• The irredundant ramsey number s(3,3,3) = 13

This page was built for publication: CO-irredundant Ramsey numbers for graphs