More Like this

1. On the coequal values of total chromatic number and chromatic index

   https://doi.org/10.1016/j.jctb.2022.10.006  

   Chen, Guantao; Hao, Yanli (January 2023, Journal of Combinatorial Theory, Series B)
2. Modeling the Effects of Longitudinal Chromatic Aberration Using Chromatic Detection Mechanisms

   https://doi.org/10.1167/jov.21.9.2736  

   Taveras-Cruz, Yesenia; He, Jingyi; Eskew, Jr. (September 2021, Journal of Vision)
3. The chromatic number of squares of random graphs

   Kalyan Garapaty; Daniel Lokshtanov; Hemanta K Maji; Alex Pothen (January 2023, The journal of combinatorics)
4. The jump of the clique chromatic number of random graphs

   https://doi.org/10.1002/rsa.21128  

   Lichev, Lyuben; Mitsche, Dieter; Warnke, Lutz (February 2023, Random Structures & Algorithms)

   Abstract The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In 2016 McDiarmid, Mitsche and Prałat noted that around  the clique chromatic number of the random graph  changes by  when we increase the edge‐probability  by , but left the details of this surprising “jump” phenomenon as an open problem. We settle this problem, that is, resolve the nature of this polynomial “jump” of the clique chromatic number of the random graph  around edge‐probability . Our proof uses a mix of approximation and concentration arguments, which enables us to (i) go beyond Janson's inequality used in previous work and (ii) determine the clique chromatic number of  up to logarithmic factors for any edge‐probability . 

   more » « less
5. Equivariant chromatic localizations and commutativity

   https://doi.org/10.1007/s40062-018-0226-2  

   Hill, Michael A. (September 2019, Journal of Homotopy and Related Structures)