Author:
Grinshpun Andrey,Sárközy Gábor N.
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference52 articles.
1. Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles;Allen;Combin. Probab. Comput.,2008
2. Partitioning edge-2-colored graphs by monochromatic paths and cycles;Balog;Combinatorica,2014
3. Partitioning a graph into a cycle and an anticycle, a proof of Lehel’s conjecture;Bessy;J. Combin. Theory, Ser. B,2010
4. Extremal Graph Theory;Bollobás,1978
5. J. Böttcher, Y. Kohayakawa, A. Taraz, A. Würfl, An Extension of the Blow-up Lemma to arrangeable graphs, arXiv:1305.2059.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献