On Ramsey (P3, P6)-minimal graphs

Authors:
Publisher website
Google Scholar
Abstract
Finding all Ramsey (G, H)-minimal graphs for a certain pair of graphs G and H is an interesting and difficult problem. Even though, it is just for small graphs G and H. In this paper, we determine some Ramsey (P 3, P 6)-minimal graphs of small order. We also characterize all such Ramsey minimal graphs of order 6 by using their degree sequences. We prove that Ramsey (P 3, P 6)-minimal graphs have diameter at least two. We construct an infinite class of trees [6] which provides Ramsey (P 3, P 6)-minimal graphs.

This publication has 2 references indexed in Scilit: