Author:
Korándi Dániel,Lang Richard,Letzter Shoham,Pokrovskiy Alexey
Funder
SNSF
SNSF Postdoc.Mobility fellowship
Deutsche Forschungsgemeinschaft
Dr. Max Rössler
Walter Haefner Foundation
ETH Zurich Foundation
Royal Society
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference40 articles.
1. P. Allen, J. Böttcher, R. Lang, J. Skokan, M. Stein, Partitioning a 2-edge-coloured graph with minimum degree 2n/3+o(n) into three monochromatic cycles, 2020, in preparation.
2. Partitioning 2-edge-colored graphs by monochromatic paths and cycles;Balogh;Combinatorica,2014
3. Partitioning a graph into a cycle and an anticycle: a proof of Lehel's conjecture;Bessy;J. Comb. Theory, Ser. B,2010
4. Cycles of even length in graphs;Bondy;J. Comb. Theory, Ser. B,1974
5. Proof of the bandwidth conjecture of Bollobás and Komlós;Böttcher;Math. Ann.,2009
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献