Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. On the connection between chromatic number, maximal clique and minimal degree of a graph;Andrásfai;Discrete Math.,1974
2. L.J. Billera, A. Björner, Face numbers of polytopes and complexes, in: J.E. Goodman, J. O'Rourke (Eds.), Handbook of Discrete and Computational Geometry, 2nd Edition, CRC Press, Boca Raton, New York, 2003, pp. 291–315.
3. B. Bollobás, Extremal Graph Theory, Academic Press, London, New York, San Francisco, 1978.
4. On colouring the nodes of a network;Brooks;Cambridge Philos. Soc.,1941
5. The maximum number of triangles in a K4-free graph;Eckhoff;Discrete Math.,1999
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Turán numbers of two kinds of Berge hypergraphs;SCIENTIA SINICA Mathematica;2024-02-01
2. Localised Graph Maclaurin Inequalities;Annals of Combinatorics;2023-11-11
3. Flag complexes and homology;Journal of Combinatorial Theory, Series A;2021-08
4. Tree densities in sparse graph classes;Canadian Journal of Mathematics;2021-06-29
5. Some sharp results on the generalized Turán numbers;European Journal of Combinatorics;2020-02