At the flick of a switch I would change mode and tart up in my new Toby, a horrendous copy of a Savile Row suit, waisted, with a twelve-inch vent at the back, drainpipe trousers and a rose in my buttonhole.

The CHROMATIC NUMBER is the minimum number of colors by means of which it is possible to color a graph in such a way that each vertex has a different color with respect to the adjacent vertices. Such a problem is an NP-hard problem [14] and [it] is even hard to obtain a good approximation of the solution in a polynomial time [17]. Although in a lot of computational problems the cost decreases when these problems are restricted to circulant graphs [6, 9], the CHROMATIC NUMBER problem is NP-hard even restrecting to circulant graphs [9]. Moreover the problem of finding a good approximation of the CHROMATIC NUMBER problem on circulant graphs is also NP-hard.

But in reality you are doing what one Dilbert reader calls multishirking, i.e., doing two nonwork activities at once. Multishirking is not only fun; it doubles the odds that an observer will think you're doing at least one work-related activity.

This is strained with a piece of cloth or a strainer and the green liquid forms the gravy of the curry.