Two infinite classes of unicyclic Ramsey (P3, P4) – Minimal graphs

Let G and H be simple graphs, the notation F → (G, H) means that for any red-blue coloring of all the edges of graph F implies F contains either a red copy of G or a blue copy of H. A graph F is Ramsey (G, H)-minimal graph if F satisfies two conditions i.e. F is Ramsey (G, H)-graph and F has minimal...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Rahmadani, Desi, Assiyatun, Hilda, Baskoro, Edy Tri
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Graph theory Graphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!