Tight Lower Bound on the Linear Chromatic Number of Pseudogrids and Improved Relationship Between Centred and Linear Chromatic Numbers
The linear chromatic number of any k × k pseudogrid G is Ω(k), which improves the previously known lower bound and leads to a tighter relationship between the centred chromatic number and the linear chromatic number of graphs.