Publisher
Springer Science and Business Media LLC
Reference42 articles.
1. Allen, P.: Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles. Combin. Probab. Comput. 17, 471–486 (2008)
2. B. Andrásfai, Remarks on a paper of Gerencsér and Gyárfás, Ann. Univ. Sci. Eötvös, Budapest., 13 (1970), 103–107
3. D. Bal and L. DeBiasio, Partitioning random graphs into monochromatic components, Electron. J. Combin., 24 (2017), Paper No. 1.18, 25 pp
4. S. Bessy and S. Thomassé, Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture, J. Combin. Theory, Ser. B, 100 (2010), 176–180
5. Bielak, H.: Local Ramsey numbers for some graphs. Discrete Math. 266, 87–99 (2003)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献