Title of article :
All Ramsey (2K2,C4)−Minimal Graphs
Author/Authors :
Wijaya, Kristiana Faculty of Mathematics and Natural Sciences - Institut Teknologi Bandung (ITB), Indonesia , Yulianti, Lyra Department of Mathematics - Faculty of Mathematics and Natural Sciences - Andalas University, Indonesia , Tri Baskoro, Edy Faculty of Mathematics and Natural Sciences - Institut Teknologi Bandung (ITB), Indonesia , Assiyatun, Hilda Faculty of Mathematics and Natural Sciences - Institut Teknologi Bandung (ITB), Indonesia , Suprijanto, Djoko Faculty of Mathematics and Natural Sciences - Institut Teknologi Bandung (ITB), Indonesia
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
Journal title :
Astroparticle Physics
