Key points are not available for this paper at this time.
In this paper we consider a colouring version of the general position problem. The -chromatic number is the smallest number of colours needed to colour V (G) such that each colour class has the no-three-in-line property. We determine bounds on this colouring number in terms of the diameter, general position number, size, chromatic number, cochromatic number and total domination number and prove realisation results. We also determine it for several graph classes, including Kneser graphs K (n, 2), line graphs of complete graphs, complete multipartite graphs, block graphs and Cartesian products. We also show that the -colouring problem is NP-complete.
V. et al. (Sat,) studied this question.