THE IRREDUNDANT RAMSEY NUMBER s(3,6)
From MaRDI portal
Publication:3487385
Recommendations
Cites work
Cited in
(11)- CO-irredundant Ramsey numbers for graphs
- scientific article; zbMATH DE number 4202304 (Why is no real title available?)
- scientific article; zbMATH DE number 89760 (Why is no real title available?)
- scientific article; zbMATH DE number 4174974 (Why is no real title available?)
- On upper domination Ramsey numbers for graphs.
- Irredundance perfect graphs
- Irredundant ramsey numbers for graphs
- The irredundance-related Ramsey numbers \(s(3,8)=21\) and \(w(3,8)=21\)
- Irredundance
- ASYMPTOTIC BOUNDS FOR IRREDUNDANT RAMSEY NUMBERS
- The irredundant ramsey number s(3,3,3) = 13
This page was built for publication: THE IRREDUNDANT RAMSEY NUMBER s(3,6)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3487385)