Funder
Science and Technology Commission of Shanghai Municipality
NSFC
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Alon, N., Shikhelman, C.: Many $$T$$ copies in $$H$$-free graphs. J. Combin. Theory Ser. B 121, 146–172 (2016)
2. Bondy, J.A., Chvátal, V.: A method in graph theory. Discrete Math. 15, 111–135 (1976)
3. Duan, X.Z., Ning, B., Peng, X., Wang, J., Yang, W.H.: Maximizing the number of cliques in graphs with given matching number. Discrete Appl. Math. 287, 110–117 (2020)
4. Duan, X.Z., Wang, J., Yang, W.H.: The generalized Turán number of linear forests. (Chin.) Adv. Math. (China) 49(4), 406–412 (2020)
5. Erdős, P., Gallai, T.: On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hungar. 10, 337–356 (1959)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献