Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Saladin Uttunggadewa"'
Publikováno v:
MethodsX, Vol 11, Iss , Pp 102350- (2023)
This paper concerns the optimization model for a multi-product multi-period raw-material selection and composition, and order quantity problem faced by a beverage company. • There are some criteria in raw material selection, which we accommodate al
Externí odkaz:
https://doaj.org/article/7e87c8e92cb34c1299fd3a9d23e210c1
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 2 (2020)
Let F, G and H be simple graphs. A graph F is said a (G,H)-arrowing graph if in any red-blue coloring of edges of F we can find a red G or a blue H. The size Ramsey number of G and H, ŕ(G,H), is the minimum size of F. If the order of F equals to the
Externí odkaz:
https://doaj.org/article/cd1c3921215b43409c8c1110f596e4a5
Publikováno v:
Journal of Mathematical and Fundamental Sciences, Vol 52, Iss 2 (2020)
Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four. In the same year, Faudree and Sheehan continued th
Externí odkaz:
https://doaj.org/article/d0dc79d7eda54f41b33f142d32b2e184
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 5, Iss 1 (2017)
Let $G$ and $H$ be simple graphs. The Ramsey number for a pair of graph $G$ and $H$ is the smallest number $r$ such that any red-blue coloring of edges of $K_r$ contains a red subgraph $G$ or a blue subgraph $H$. The size Ramsey number for a pair of
Externí odkaz:
https://doaj.org/article/a5672ce5069d4d3389bc5b2f607e83f8
Autor:
Aditya Firman Ihsam, null Darmadi, Saladin Uttunggadewa, Silvya Dewi Rahmawati, Irsyad Giovanni, Salamet Nur Himawan
Publikováno v:
2022 5th International Conference on Information and Communications Technology (ICOIACT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07849d7859b47cfc673c489f3ff63ff1
https://doi.org/10.1109/icoiact55506.2022.9971837
https://doi.org/10.1109/icoiact55506.2022.9971837
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 3, Pp 757-769 (2019)
For any pair of graphs G and H, both the size Ramsey number ̂r(G,H) and the restricted size Ramsey number r*(G,H) are bounded above by the size of the complete graph with order equals to the Ramsey number r(G,H), and bounded below by e(G) + e(H) −
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0c5fb008c7e43ec872c1fc6556c8d87
https://doaj.org/article/b9a6f01f458b45ed9e96c4f60c78fcc3
https://doaj.org/article/b9a6f01f458b45ed9e96c4f60c78fcc3
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 2 (2020)
Let F, G and H be simple graphs. A graph F is said a (G,H)-arrowing graph if in any red-blue coloring of edges of F we can find a red G or a blue H. The size Ramsey number of G and H, ŕ(G,H), is the minimum size of F. If the order of F equals to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be7f2850440e036c95fa01afcef288d9
https://doi.org/10.5614/ejgta.2020.8.2.14
https://doi.org/10.5614/ejgta.2020.8.2.14
Publikováno v:
Journal of Mathematical and Fundamental Sciences, Vol 52, Iss 2 (2020)
Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four. In the same year, Faudree and Sheehan continued th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9afe0aea4df0b01214b32fc2baf6e118
https://doi.org/10.5614/j.math.fund.sci.2020.52.2.1
https://doi.org/10.5614/j.math.fund.sci.2020.52.2.1
Publikováno v:
ICGTIS
Let c be a k -coloring of a (not necessary connected) graph H . Let П= { C 1, C 2, · · ·, Ck } be the partition of V ( H ) induced by c , where Ci is partition class receiving color i . The color code c П ( v ) of a vertex v ∈ H is the ordered
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c6957bee76603831458a66df80e238b