[LT10]	R. Lewis, J. Thompson (2010). On the application of graph colouring techniques in round-robin sports scheduling. Computers & Operations Research, vol. In Press, Corrected Proof, pp. -. [ bib | DOI | http ]
[HS08]	S. Hossain, T. Steihaug (2008). Graph coloring in the estimation of sparse derivative matrices: Instances and applications. Discrete Applied Mathematics, vol. 156, no. 2, pp. 280-288. [ bib | DOI ]
[ZAG08]	N. Zufferey, P. Amstutz, P. Giaccari (2008). Graph Colouring Approaches for a Satellite Range Scheduling Problem. Journal of Scheduling, vol. 11, no. 4, pp. 263 - 277. [ bib ]
[BMPR07]	E. K. Burke, J. Mareček, A. J. Parkes, H. Rudová (2007). On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling. Tech. Rep. NOTTCS-TR-2007-10, The University of Nottingham, Nottingham. [ bib | http ]
[GHO07]	M. Gamache, A. Hertz, J. O. Ouellet (2007). A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding. Computers & Operations Research, vol. 34, no. 8, pp. 2384-2395. [ bib | DOI ]
[SRH04]	M. D. Smith, N. Ramsey, G. Holloway (2004). A generalized algorithm for graph-coloring register allocation. In PLDI '04: Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, pp. 277-288. ACM Press, New York, NY, USA. ISBN 1-58113-807-5. [ bib | DOI ]
[ZKW03]	A. Zymolka, A. M. C. A. Koster, R. Wessäly (2003). Transparent optical network design with sparse wavelength conversion. In Proceedings of the 7th IFIP Working Conference on Optical Network Design & Modelling, pp. 61-80. Budapest, Hungary. [ bib ]
[BB02]	N. Barnier, P. Brisset (2002). Graph Coloring for Air Traffic Flow Management. In CPAIOR'02: Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, pp. 133-147. Le Croisic, France. [ bib ]
[AKL02]	M. Allen, G. Kumaran, T. Liu (2002). A Combined Algorithm for Graph-coloring in Register Allocation. In D. S. Johnson, A. Mehrotra, M. Trick (eds.), Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 100-111. Ithaca, New York, USA. [ bib ]
[GS02]	C. Gomes, D. Shmoys (2002). Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem. In D. S. Johnson, A. Mehrotra, M. Trick (eds.), Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 22-39. Ithaca, New York, USA. [ bib ]
[HS02]	S. Hossain, T. Steihaug (2002). Graph coloring in the estimation of mathematical derivatives. In D. S. Johnson, A. Mehrotra, M. Trick (eds.), Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 9-16. Ithaca, New York, USA. [ bib ]
[Fre00]	R. Freimer (2000). Generalized map coloring for use in geographical information systems. In K.-J. Li, K. Makki, N. Pissinou, S. Ravada (eds.), ACM-GIS 2000, Proceedings of the Eighth ACM Symposium on Advances in Geographic Information Systems, pp. 167-173. ACM press, New York, NY, USA. ISBN 1-58113-319-7. [ bib | DOI ]
[LC96]	G. Lewandowski, A. Condon (1996). Experiments with parallel graph coloring heuristics and applications of graph coloring. vol. 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 309-334. American Mathematical Society, Providence, RI, USA. [ bib ]
[de 85]	D. de Werra (1985). An introduction to timetabling. European Journal of Operational Research, vol. 19, no. 2, pp. 151-162. [ bib | DOI | http ]
[Lei79]	F. T. Leighton (1979). A Graph Coloring Algorithm for Large Scheduling Problems. Journal of Research of the National Bureau of Standards, vol. 84, no. 6, pp. 489-506. [ bib ]
[GJS76]	M. R. Garey, D. S. Johnson, H. C. So (1976). An Application of Graph Coloring to Printed Circuit Testing. IEEE Transactions on Circuits and Systems, vol. 23, pp. 591-599. [ bib ]
[Woo69]	D. C. Wood (1969). A Technique for Coloring a Graph Applicable to Large-Scale Timetabling Problems. Computer Journal, vol. 12, pp. 317-322. [ bib ]