On an upper bound of a graph's chromatic number, depending on the graph's degree and density
- 1 October 1977
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 23 (2-3) , 247-250
- https://doi.org/10.1016/0095-8956(77)90037-5
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A Problem in Graph ColoringThe American Mathematical Monthly, 1970
- The smallest triangle-free 4-chromatic 4-regular graphJournal of Combinatorial Theory, 1970
- On chromatic number of finite set-systemsActa Mathematica Hungarica, 1968
- Graph Theory and ProbabilityCanadian Journal of Mathematics, 1959