Author:
Balogh József,Barát János,Gerbner Dániel,Gyárfás András,Sárközy Gábor N.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference29 articles.
1. P. Allen: Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles, Combinatorics, Probability and Computing 17 (2008), 471–486.
2. J. Ayel: Sur l’existence de deux cycles supplementaires unicolorés, disjoints et de couleurs differentes dans un graphe complet bicolore, Thesis, University of Grenoble, (1979).
3. F. S. Benevides, T. Luczak, A. Scott, J. Skokan, M. White: Monochromatic cycles and the monochromatic circumference in 2-coloured graphs, Combin. Probab. Comput. 21 (2012), 57–87.
4. S. Bessy, S. Thomassé: Partitioning a graph into a cycle and an anticycle, a proof of Lehel’s conjecture, Journal of Combinatorial Theory, Series B 100 (2010), 176–180.
5. P. Erdős, T. Gallai: On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337–356.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献