Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/112304
Title: All unicyclic Ramsey (mK2, P4)-minimal graphs
Authors: BASKORO, Edy Tri
WIJAYA, Kristiana
RYAN, Joe
Keywords: All unicyclic Ramsey (mK2, P4)
Issue Date: 1-Feb-2022
Publisher: The Australasian Journal of Combinatorics
Abstract: For graphs F, G and H, we write F → (G, H) to mean that if the edges of F are colored with two colors, say red and blue, then the red subgraph contains a copy of G or the blue subgraph contains a copy of H. The graph F is called a Ramsey (G, H) graph if F → (G, H). Furthermore, the graph F is called a Ramsey (G, H)-minimal graph if F → (G, H) but F − e 6→ (G, H) for any edge e ∈ E(F). In this paper, we characterize all unicyclic Ramsey (G, H)-minimal graphs when G is a matching mK2 for any integer m ≥ 2 and H is a path on four vertices.
URI: https://repository.unej.ac.id/xmlui/handle/123456789/112304
Appears in Collections:LSP-Jurnal Ilmiah Dosen

Files in This Item:
File Description SizeFormat 
FMIPA_All unicyclic Ramsey (mK2, P4)-minimal graphs.pdf1.74 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.