Another bound on the chromatic number of a graph
- 31 December 1978
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 24 (1) , 1-6
- https://doi.org/10.1016/0012-365x(78)90167-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Covering the vertex set of a graph with subgraphs of smaller degreeDiscrete Mathematics, 1978
- Graph Decompositions Satisfying Extremal Degree ConstraintsJournal of Graph Theory, 1978
- 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
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941