سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات162
تعداد شماره‌ها6,691
تعداد مقالات72,219
تعداد مشاهده مقاله129,110,920
تعداد دریافت فایل اصل مقاله101,915,072
Wijaya, Kristiana, Yulianti, Lyra, Baskoro, Edy Tri, Assiyatun, Hilda, Suprijanto, Djoko. (1394). All Ramsey (2K2,C4)−Minimal Graphs. , 46(1), 9-25. doi: 10.22059/jac.2015.7922
Kristiana Wijaya; Lyra Yulianti; Edy Tri Baskoro; Hilda Assiyatun; Djoko Suprijanto. "All Ramsey (2K2,C4)−Minimal Graphs". , 46, 1, 1394, 9-25. doi: 10.22059/jac.2015.7922
Wijaya, Kristiana, Yulianti, Lyra, Baskoro, Edy Tri, Assiyatun, Hilda, Suprijanto, Djoko. (1394). 'All Ramsey (2K2,C4)−Minimal Graphs', , 46(1), pp. 9-25. doi: 10.22059/jac.2015.7922
Wijaya, Kristiana, Yulianti, Lyra, Baskoro, Edy Tri, Assiyatun, Hilda, Suprijanto, Djoko. All Ramsey (2K2,C4)−Minimal Graphs. , 1394; 46(1): 9-25. doi: 10.22059/jac.2015.7922

All Ramsey (2K2,C4)−Minimal Graphs

Journal of Algorithms and Computation
مقاله 1، دوره 46، شماره 1، اسفند 2015، صفحه 9-25    اصل مقاله (7.45 M)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2015.7922
نویسندگان
Kristiana Wijaya* 1؛ Lyra Yulianti2؛ Edy Tri Baskoro3؛ Hilda Assiyatun3؛ Djoko Suprijanto3
1Combinatorial Mathematics Research Group, Faculty of Mathematics and natural Sciences, Institut Teknologi Bandung (ITB), Jalan Ganesa 10 Bandung 40132 Indonesia
2Department of Mathematics, Faculty of Mathematics and Natural Sciences, Andalas University, Kampus UNAND Limau Manis Padang 25136 Indonesia
3Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung (ITB), Jalan Ganesa 10 Bandung 40132 Indonesia
چکیده
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).
کلیدواژه‌ها
Ramsey minimal graph؛ edge coloring؛ graph 2K2؛ cycle graph
آمار
تعداد مشاهده مقاله: 1,638
تعداد دریافت فایل اصل مقاله: 1,271





سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب