A remark on star-C4 and wheel-C4 Ramsey numbers
Given two graphs G1 and G2, the Ramsey number R(G1;G2)<br />is the smallest integer N such that, for any graph G of order N, either G1 is a subgraph of G, or G2 is a subgraph of the complement of G. Let Cn denote a cycle of order n, Wn a wheel of order n+1 and Sn a star of order n. In this pap...
Main Authors: | Yanbo Zhang, Hajo Broersma, Yaojun Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2014-10-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/73 |
Similar Items
-
On the Ramsey number of 4-cycle versus wheel
by: Enik Noviani, et al.
Published: (2016-10-01) -
A Note on the Ramsey Number of Even Wheels Versus Stars
by: Haghi Sh., et al.
Published: (2018-05-01) -
On size multipartite Ramsey numbers for stars
by: Anie Lusiani, et al.
Published: (2020-01-01) -
On size multipartite Ramsey numbers for stars versus paths and cycles
by: Anie Lusiani, et al.
Published: (2017-04-01) -
Critical Graphs for R(Pn, Pm) and the Star-Critical Ramsey Number for Paths
by: Hook Jonelle
Published: (2015-11-01)