Author:
Hu Ping,Lidický Bernard,Martins Taísa,Norin Sergey,Volec Jan
Publisher
Springer International Publishing
Reference9 articles.
1. Andrásfai, B., Erdős, P., Sós, V.T.: On the connection between chromatic number, maximal clique and minimal degree of a graph. Discrete Math. 8, 205–218 (1974)
2. Balogh, J., Clemen, F.C., Lavrov, M., Lidický, B., Pfender, F.: Making $${K}_{r+1}$$-free graphs $$r$$-partite. Combin. Probab. Comput. (2020)
3. Balogh, J., Clemen, F.C., Lidický, B.: Max cuts in triangle-free graphs. Manuscript (2021)
4. Erdős, P.: Problems and results in graph theory and combinatorial analysis. In: Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975), pp. 169–192. Congressus Numerantium, No. XV (1976)
5. Erdős, P., Faudree, R., Pach, J., Spencer, J.: How to make a graph bipartite. J. Combin. Theor. Ser. B 45(1), 86–98 (1988)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献