Talk:Graph coloring

Mathematics or Computer science?

My initial impression of this article is that there is a lot of good content here, and the article does a good job of basic terms. But one problem is that the article tries to be both a mathematics article and a computer science article. To some extent, this is unavoidable because the mathematical terminology may not be familiar to compiler designers, and it is useful to all readers to have a sense of the breadth of applicability of graph coloring. But, unfortunately, the result is that the article jumps back and forth between disciplines to some extent, and really doesn't do justice to either. My recommendation is to write a separate article on graph coloring in mathematics, perhaps summarizing the basic terminology and results in the computer science article. A more detailed account, say, of register allocation would be useful. In the mathematics article it would be interesting to hear a bit more about Sudoku. The article should also talk about th solution of the 4-color problem and (personal bias!) G. Ringel's work on colorings of graphs on surfaces other than the sphere. It would be nice to see a bit more about edge coloring and tractability. Greg Woodhouse 12:30, 30 April 2007 (CDT)

Changing status to "developing"

I'm changing the status of this article to 2 ("Developing article") because, while there is a lot of good content here, it tends to present definitions without enough context or discussion, and doesn't really "come together" as a coherent whole. That sounds a bit harsher than I intend, but I'm not sure how else to put it. Greg Woodhouse 12:36, 30 April 2007 (CDT)