Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference23 articles.
1. S. Brandt: On the structure of dense triangle-free graphs, Combinatorica 20 (1999), 237–245.
2. S. Brandt and S. Thomassé: Dense triangle-free graphs are 4-colorable: A solution to the Erdos-Simonovits problem, http://www.lirmm.fr/~thomasse/liste/vega11.pdf .
3. M. El-Zahar and N. Sauer: The chromatic number of the product of two 4-chromatic graphs is 4, Combinatorica, 5 (1985), 121–126.
4. Atti dei Convegni Lincei;P Erdős,1976
5. P. Erdős and M. Simonovits: On a valence problem in extremal graph theory, Discrete Mathematics, 5 (1973), 323–334.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the maximum number of edges in -critical graphs;Combinatorics, Probability and Computing;2023-07-24
2. On semi-transitive orientability of triangle-free graphs;Discussiones Mathematicae Graph Theory;2020
3. Domination game critical graphs;Discussiones Mathematicae Graph Theory;2015