On irredundant Ramsey numbers for graphs
From MaRDI portal
Publication:3484871
Recommendations
- Irredundant ramsey numbers for graphs
- Irredundant ramsey numbers for graphs
- scientific article; zbMATH DE number 125619
- CO-irredundant Ramsey numbers for graphs
- scientific article; zbMATH DE number 519813
- Publication:4489188
- Ramsey properties of generalised irredundant sets in graphs
- scientific article; zbMATH DE number 57428
- scientific article; zbMATH DE number 4148134
- scientific article; zbMATH DE number 834108
Cited in
(20)- A lower bound for irredundant Ramsey numbers
- On upper domination Ramsey numbers for graphs.
- Irredundance perfect graphs
- Ramsey numbers, graph eigenvalues, and a conjecture of Cao and Yuan
- Irredundant and open irredundant colorings of graphs
- Irredundant ramsey numbers for graphs
- scientific article; zbMATH DE number 5717180 (Why is no real title available?)
- scientific article; zbMATH DE number 89760 (Why is no real title available?)
- scientific article; zbMATH DE number 125619 (Why is no real title available?)
- Irredundant ramsey numbers for graphs
- ASYMPTOTIC BOUNDS FOR IRREDUNDANT RAMSEY NUMBERS
- The irredundant ramsey number s(3,3,3) = 13
- The irredundant ramsey number s(3, 7)
- CO-irredundant Ramsey numbers for graphs
- Asymptotic bounds for irredundant and mixed Ramsey numbers
- scientific article; zbMATH DE number 1416461 (Why is no real title available?)
- Avoidance colourings for small nonclassical Ramsey numbers
- Ramsey properties of generalised irredundant sets in graphs
- The irredundance-related Ramsey numbers s(3,8)=21 and w(3,8)=21
- Bounds for irredundant and co-irredundant Ramsey numbers
This page was built for publication: On irredundant Ramsey numbers for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484871)