THE IRREDUNDANT RAMSEY NUMBER s(3,6)
From MaRDI portal
Publication:3487385
DOI10.1080/16073606.1990.9631608zbMATH Open0707.05047OpenAlexW2085349498MaRDI QIDQ3487385FDOQ3487385
Authors: Richard C. Brewster, E. J. Cockayne, Christina M. Mynhardt
Publication date: 1990
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1828/2712
Recommendations
Cites Work
Cited In (11)
- Title not available (Why is that?)
- 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
- CO-irredundant Ramsey numbers for graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
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)