| Autor: |
Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto |
| Jazyk: |
angličtina |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 2, Pp 174-186 (2018) |
| Druh dokumentu: |
article |
| ISSN: |
0972-8600 |
| DOI: |
10.1016/j.akcej.2017.08.003 |
| Popis: |
Let and be simple graphs. We write to mean that any red–blue coloring of all edges of will contain either a red copy of or a blue copy of A graph (without isolated vertices) satisfying and for each is called a Ramsey -minimal graph. The set of all Ramsey -minimal graphs is denoted by In this paper, we derive the necessary and sufficient condition of graphs belonging to for any connected graph Moreover, we give a relation between Ramsey - and -minimal graphs, and Ramsey - and -minimal graphs. Furthermore, we determine all graphs in |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
