Funder
London School of Economics and Political Science
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles;Allen;Combin. Probab. Comput.,2008
2. J. Ayel, Sur l'existence de deux cycles supplémentaires unicolores, disjoints et de couleurs différentes dans un graphe complet bicolore, Thése de l'université de Grenoble, 1979.
3. J. Balogh, J. Barát, D. Gerbner, A. Gyárfás, G. Sárközy, Partitioning edge-2-colored graphs by monochromatic paths and cycles, preprint, 2014.
4. Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture;Bessy;J. Combin. Theory Ser. B,2010
5. Graph Theory;Diestel,2000
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献