# Graph Coloring - searching for some interesting problems

I'm a high school student and writing a paper about graph coloring. Can you tell me something about some interesting problems in graph theory connected with graph coloring? Such as full triangle coloring or 2COL problem? i will be pleased. :)

Sorry for my bad english, John

-
There are of course generalizations of chromatic polynomials. I believe there is even some game-theoretic research of coloring which you could google for. Also helpful would be to look through anything related to Bill Tutte. –  anon Jan 27 '12 at 20:40
Also posted to MathOverflow. –  Gerry Myerson Jan 27 '12 at 22:19

Consider the graph whose vertex set is every point in the real plane. We will say two vertices in this graph are adjacent whenever they are exactly unit distance apart. For example, the points $(0, 0)$ and $(\sqrt{2}/2, \sqrt{2}/2)$ are adjacent in this graph.