@article {
author = {Wijaya, Kristiana and Yulianti, Lyra and Baskoro, Edy Tri and Assiyatun, Hilda and Suprijanto, Djoko},
title = {All Ramsey (2K2,C4)−Minimal Graphs},
journal = {Journal of Algorithms and Computation},
volume = {46},
number = {1},
pages = {9-25},
year = {2015},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2015.7922},
abstract = {Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by R(G,H). In this paper, we characterize all graphs which are in R(2K2,C4).},
keywords = {Ramsey minimal graph,edge coloring,graph 2K2,cycle graph},
url = {https://jac.ut.ac.ir/article_7922.html},
eprint = {https://jac.ut.ac.ir/article_7922_651e3bc41b32f240cb33e7a9669c32df.pdf}
}