Colouring a graph with position sets
Combinatorics
2025-09-11 v2
Abstract
In this paper we consider a colouring version of the general position problem. The \emph{-chromatic number} is the smallest number of colours needed to colour the vertices of the graph 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 the -chromatic number of several graph classes, including Kneser graphs , line graphs of complete graphs, complete multipartite graphs, block graphs and Cartesian products. Finally, we show that the -colouring problem is NP-complete.
Cite
@article{arxiv.2408.13494,
title = {Colouring a graph with position sets},
author = {Ullas Chandran S. V. and Gabriele Di Stefano and Haritha S. and Elias John Thomas and James Tuite},
journal= {arXiv preprint arXiv:2408.13494},
year = {2025}
}