On Ramsey \((mK_2,H)\)-minimal graphs
From MaRDI portal
Publication:2361089
DOI10.1007/S00373-016-1748-1zbMath1407.05239OpenAlexW2560239338MaRDI QIDQ2361089
Kristiana Wijaya, Djoko Suprijanto, Hilda Assiyatun, Edy Tri Baskoro
Publication date: 29 June 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-016-1748-1
Related Items (2)
Cites Work
- On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs
- Ramsey-minimal graphs for forests
- Matching-star Ramsey sets
- On Ramsey numbers for trees versus wheels of five or six vertices
- On Ramsey \((mK_2,H)\)-minimal graphs
- Ramsey \((K_ {1,2},K_ 3)\)-minimal graphs
- On Ramsey (K1,2,C4)-minimal graphs
- On Ramsey (2K 2, K 4)−Minimal Graphs
- The Ramsey number for a cycle of length five vs. a complete graph of order six
- The Complete List of Ramsey (2K2,K4)-Minimal Graphs
- On Ramsey (3K2,P3)-minimal graphs
- On Ramsey minimal graphs
- On Ramsey minimal graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Ramsey \((mK_2,H)\)-minimal graphs