Open AccessOn Unicyclic Ramsey (mK2, P3)−Minimal Graphs
Author(s) -
Kristiana Wijaya,
Edy Tri Baskoro,
Hilda Assiyatun,
Djoko Suprijanto
Publication year - 2015
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2015.12.067
Subject(s) - computer science , combinatorics , ramsey's theorem , ramsey theory , graph , discrete mathematics , theoretical computer science , mathematics
Ramsey minimal graph is one of growing topics in Ramsey theory. The search of Ramsey minimal graphs for a combination of graphs G and H is an interesting and difficult problem. In this paper, we study the properties of Ramsey minimal graphs for G = mK2 and H = Pn. In particular, we determine all unicyclic Ramsey minimal graphs for this combination
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom