Browsing LECTURER SCIENTIFIC PUBLICATION (Publikasi Ilmiah) by Subject "Ramsey minimal graph"
Now showing items 1-4 of 4
-
On Ramsey (3K2,K3)−minimal graphs
(AIP Conference Proceedings, 2016-02-24)The Ramsey graph theory has many interesting applications, such as in the fields of communications, information retrieval, and decision making. One of growing topics in Ramsey theory is Ramsey minimal graph. For any given ... -
On Ramsey (4K2, P3)-minimal graphs
(AKCE International Journal of Graphs and Combinatorics, 2018-08-13)Let F, G, and H be simple graphs. We write F → (G, H) to mean that any red–blue coloring of all edges of F will contain either a red copy of G or a blue copy of H. A graph F (without isolated vertices) satisfying F → (G, ... -
On Ramsey (mK2, H)-Minimal Graphs
(Graphs and Combinatorics, 2017-01-02)Let R(G, H) denote the set of all graphs F satisfying F → (G, H) and for every e ∈ E(F), (F − e) (G, H). In this paper, we derive the necessary and sufficient conditions for graphs belonging to R(mK2, H) for any graph ... -
On Ramsey Minimal Graphs for a 3-Matching Versus a Path on Five Vertices
(Proceedings of the International Conference on Mathematics, Geometry, Statistics, and Computation, 2022-02-08)Let 𝐺, 𝐻, and 𝐹 be simple graphs. The notation 𝐹 ⟶ (𝐺, 𝐻) means that any red-blue coloring of all edges of 𝐹 contains a red copy of 𝐺 or a blue copy of 𝐻. The graph 𝐹 satisfying this property is called a Ramsey ...