Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. D. T. Busolini, Monochromatic paths and circuits in edge-colored graphs,J. Combinatorial Theory Ser. B,10 (1971), 299–300.
2. V. Chvátal, Monochromatic paths in edge-colored graphs,J. Combinatorial Theory Ser. B,13 (1972), 69–70.
3. N. G. De Bruijn, C. Tenbergen and D. Kruywijk, On the set of divisors of a number,Nieuw Arch. Wisk.,23 (1952), 191–193.
4. R. P. Dilworth, A decomposition theorem for partially ordered sets,Ann. of Math.,51 (1950), 161–166.
5. T. Gallai, On directed paths and circuits, in: “Theory of Graphs” (Erdős, P. and Katona, G. eds.), Academic Press (New York, 1968), pp. 115–118.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Ramsey-nice families of graphs;European Journal of Combinatorics;2018-08
3. Problems and results in Extremal Combinatorics – III;Journal of Combinatorics;2016
4. Maximum directed cuts in acyclic digraphs;Journal of Graph Theory;2007
5. Repeated communication and Ramsey graphs;IEEE Transactions on Information Theory;1995