Title of article
The complete list of Ramsey (2K2;K4)-minimal graphs
Author/Authors
Wijaya, Kristiana Institut Teknologi Bandung - Faculty of Mathematics and Natural Sciences - Combinatorial Mathematics Research Group, Indonesia , Baskoro, Edy Tri Institut Teknologi Bandung - Faculty of Mathematics and Natural Sciences - Combinatorial Mathematics Research Group, Indonesia , Assiyatun, Hilda Institut Teknologi Bandung - Faculty of Mathematics and Natural Sciences - Combinatorial Mathematics Research Group, Indonesia , Suprijanto, Djoko Institut Teknologi Bandung - Faculty of Mathematics and Natural Sciences - Combinatorial Mathematics Research Group, Indonesia
From page
216
To page
227
Abstract
Let F; G; and H be non-empty graphs. The notation F→ (G;H) means that if all edges of F are arbitrarily colored by red or blue, then either the subgraph of F induced by all red edges contains a graph G or the subgraph of F induced by all blue edges contains a graph H: A graph F satisfying two conditions: F→(G;H) and for every e (element of) E(F); (F-e) (nrightarrow) (G;H) is called a Ramsey (G;H)-minimal graph. In this paper, we determine all non-isomorphic Ramsey (2K2;K4)-minimal graphs.
Keywords
Ramsey minimal graph , red , blue coloring , complete graph
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Record number
2621243
Link To Document