On Ramsey (3K2,K3)−minimal graphs

Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/112319

Full metadata record

DC Field	Value	Language
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:42:01Z	-
dc.date.available	2023-02-22T03:42:01Z	-
dc.date.issued	2016-02-24	-
dc.identifier.uri	https://repository.unej.ac.id/xmlui/handle/123456789/112319	-
dc.description.abstract	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 graphs G and H, find graphs F such that any red-blue coloring of all edges of F contains either a red copy of G or a blue copy of H. If this condition is not satisfied by the graph F −e, then we call the graph F as a Ramsey (G,H)−minimal. In this paper, we derive the properties of (3K2,K3)−minimal graphs. We, then, characterize all Ramsey (3K2,K3)−minimal graphs	en_US
dc.language.iso	en	en_US
dc.publisher	AIP Conference Proceedings	en_US
dc.subject	Ramsey minimal graph	en_US
dc.subject	edge coloring	en_US
dc.subject	matching	en_US
dc.subject	complete graph	en_US
dc.title	On Ramsey (3K2,K3)−minimal graphs	en_US
dc.type	Article	en_US
Appears in Collections:	LSP-Conference Proceeding

Files in This Item:

File	Description	Size	Format
FMIPA_On Ramsey (3K2,K3)−minimal graphs.pdf		809.9 kB	Adobe PDF	View/Open

DSpace JSPUI