On Reed’s Conjecture about ω,Δ and χ
- 20 December 2006
- book chapter
- Published by Springer Nature
- p. 339-346
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Recognizing Berge GraphsCombinatorica, 2005
- β-Perfect GraphsJournal of Combinatorial Theory, Series B, 1996
- On Brooks' Theorem for Sparse GraphsCombinatorics, Probability and Computing, 1995
- A bound on the chromatic number of a graphDiscrete Mathematics, 1978
- On an upper bound of a graph's chromatic number, depending on the graph's degree and densityJournal of Combinatorial Theory, Series B, 1977
- Three short proofs in graph theoryJournal of Combinatorial Theory, Series B, 1975
- A Problem in Graph ColoringThe American Mathematical Monthly, 1970
- The smallest triangle-free 4-chromatic 4-regular graphJournal of Combinatorial Theory, 1970
- Graph Theory and ProbabilityCanadian Journal of Mathematics, 1959
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941