On the restricted size Ramsey number for P3 versus dense connected graphs
<p>Let <em>F</em>, <em>G</em> and <em>H</em> be simple graphs. A graph <em>F</em> is said a (<em>G,H</em>)-arrowing graph if in any red-blue coloring of edges of <em>F </em>we can find a red <em>G</em> or a blu...
Main Authors: | Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa |
---|---|
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
2020-10-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/1053 |
Similar Items
-
Restricted size Ramsey number for path of order three versus graph of order five
by: Denny Riama Silaban, et al.
Published: (2017-04-01) -
Restricted Size Ramsey Number Involving Matching and Graph of Order Five
by: Denny Riama Silaban, et al.
Published: (2020-09-01) -
On the Restricted Size Ramsey Number Involving a Path P3
by: Silaban Denny Riama, et al.
Published: (2019-08-01) -
Restricted size Ramsey number for P3 versus cycle
by: Joanna Cyman, et al.
Published: (2020-10-01) -
The connected size Ramsey number for matchings versus small disconnected graphs
by: Hilda Assiyatun, et al.
Published: (2019-04-01)