The Ramsey numbers for disjoint unions of graphs
From MaRDI portal
Publication:952673
DOI10.1016/J.DISC.2007.04.026zbMATH Open1172.05042OpenAlexW2772634519MaRDI QIDQ952673FDOQ952673
Authors: Hasmawati, E. T. Baskoro, H. Assiyatun 
Publication date: 12 November 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.026
Recommendations
Cites Work
- On Ramsey numbers for trees versus wheels of five or six vertices
- The Ramsey numbers of stars versus wheels
- Title not available (Why is that?)
- Ramsey Theorems for Multiple Copies of Graphs
- Title not available (Why is that?)
- Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
- The Ramsey numbers for disjoint unions of trees
- On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\)
Cited In (11)
- On the Ramsey number for a linear forest versus a cocktail party graph
- Title not available (Why is that?)
- Ramsey numbers for a disjoint union of good graphs
- Ramsey numbers for a disjoint union of some graphs
- On Ramsey numbers for large disjoint unions of graphs
- The Ramsey numbers for disjoint unions of trees
- Ramsey and 2-local Ramsey numbers for disjoint unions of cycles
- Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
- THE RAMSEY NUMBER FOR A LINEAR FOREST VERSUS TWO IDENTICAL COPIES OF COMPLETE GRAPHS
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: The Ramsey numbers for disjoint unions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952673)
