Funder
National Natural Science Foundation of China
Science and Technology Commission of Shanghai Municipality
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Bielak, H., Kieliszek, S.: The Turán number of the graph $$3P_4$$. Ann. Univ. Mariae Curie-Sklodowska Sect. A 68, 21–29 (2014)
2. Bielak, H., Kieliszek, S.: The Turán number of the graph $$2P_5$$. Discuss. Math. Graph Theory 36(3), 683–694 (2016)
3. Erdős, P., Gallai, T.: On maximal paths and circuits of graphs. Acta Math. Hung. 10(3), 337–356 (1959)
4. Erdős, P.: über ein Extremalproblem in der Graphentheorie. Arch. Math. (Basel) 13, 122–127 (1962). (German)
5. Faudree, R.J., Schelp, R.H.: Path Ramsey numbers in multicolourings. J. Combin. Theory B 19, 150–160 (1975)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献