On irredundant Ramsey numbers for graphs
From MaRDI portal
Publication:3484871
DOI10.1002/JGT.3190140407zbMATH Open0705.05048OpenAlexW2032666781MaRDI QIDQ3484871FDOQ3484871
Authors: Johannes H. Hattingh
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140407
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
- Publication:4860357
Cited In (18)
- Title not available (Why is that?)
- Ramsey numbers, graph eigenvalues, and a conjecture of Cao and Yuan
- Title not available (Why is that?)
- Ramsey properties of generalised irredundant sets in graphs
- On upper domination Ramsey numbers for graphs.
- Irredundance perfect graphs
- Avoidance colourings for small nonclassical Ramsey numbers
- Irredundant ramsey numbers for graphs
- The irredundance-related Ramsey numbers \(s(3,8)=21\) and \(w(3,8)=21\)
- Title not available (Why is that?)
- Irredundant ramsey numbers for graphs
- Asymptotic bounds for irredundant and mixed Ramsey numbers
- Irredundant and open irredundant colorings of 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
- Title not available (Why is that?)
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)