On Ramsey (mK2, H)-Minimal Graphs

dc.contributor.author	WIJAYA, Kristiana
dc.contributor.author	BASKORO, Edy Tri
dc.contributor.author	ASSIYATUN, Hilda
dc.contributor.author	SUPRIJANTO, Djoko
dc.date.accessioned	2023-02-22T03:06:14Z
dc.date.available	2023-02-22T03:06:14Z
dc.date.issued	2017-01-02
dc.identifier.uri	https://repository.unej.ac.id/xmlui/handle/123456789/112313
dc.description.abstract	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 H and each positive integer m. We give all disconnected graphs in R(mK2, H), for any connected graph H. Furthermore, we prove that if F ∈ R(mK2, P3), then any graph obtained by subdividing one non-pendant edge in F will be in R((m + 1)K2, P3)	en_US
dc.language.iso	en	en_US
dc.publisher	Graphs and Combinatorics	en_US
dc.subject	Ramsey minimal graph	en_US
dc.subject	Edge coloring	en_US
dc.subject	Matching	en_US
dc.subject	Path	en_US
dc.subject	Subdivision	en_US
dc.title	On Ramsey (mK2, H)-Minimal Graphs	en_US
dc.type	Article	en_US