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, ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results