The irredundant ramsey number s(3,3,3) = 13
From MaRDI portal
Publication:4309987
DOI10.1002/jgt.3190180607zbMath0807.05057OpenAlexW2077244872MaRDI QIDQ4309987
E. J. Cockayne, Christina M. Mynhardt
Publication date: 28 February 1995
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190180607
Related Items
On upper domination Ramsey numbers for graphs., CO-irredundant Ramsey numbers for graphs, Irredundance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isomorphism of circulant graphs and digraphs
- On irredundant Ramsey numbers for graphs
- THE IRREDUNDANT RAMSEY NUMBER s(3,6)
- Irredundant ramsey numbers for graphs
- Asymptotic bounds for irredundant and mixed Ramsey numbers
- Point-symmetric graphs with a prime number of points
- Combinatorial Relations and Chromatic Graphs