Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence, ...

How color became code -- Chromatic visions (400 B.C.-1969) -- Colors sacred and synthetic -- Classical and modern color: Plato through Goethe -- Industrial color: synthetics through day-glo ...

Abstract. In the present paper we are interested in the study of the distance Laplacian eigenvalues of a connected graph with fixed order n and chromatic number χ. We prove lower bounds on the ...

Vol. 12, No. 4, Dedicated to Professor Ko-Wei Lih on the Occasion of His 60th Birthday (July 2008), pp. 997-1005 (9 pages) The circular chromatic number χc(G) of a graph G is a very natural ...