Chromatic optimisation: Limitations, objectives, uses, references
- 30 September 1982
- journal article
- review article
- Published by Elsevier in European Journal of Operational Research
- Vol. 11 (1) , 1-19
- https://doi.org/10.1016/s0377-2217(82)80002-7
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Brooks' graph-coloring theorem and the independence numberJournal of Combinatorial Theory, Series B, 1979
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- Complete-Link Cluster Analysis by Graph ColoringJournal of the American Statistical Association, 1978
- A bibliographic survey of edge-coloringsJournal of Graph Theory, 1978
- Some applications of equalized matricesPublished by Springer Nature ,1978
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- Compactness and balancing in schedulingMathematical Methods of Operations Research, 1977
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- An Algorithm for Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1973
- An algorithm for the chromatic number of a graphThe Computer Journal, 1971