Answers are grounded in this paper and cite their sources.
This analysis investigates linear chromatic number in graphs, revealing improved bounds and implications for treedepth.
Motivated by algorithmic applications, Kun, O’Brien, Pilipczuk, and Sullivan introduced the parameter linear chromatic number as a relaxation of treedepth and proved that the two parameters are polynomially related. They conjectured that treedepth could be bounded from above by twice the linear chromatic number. In this paper we investigate the properties of linear chromatic number and provide improved bounds in several graph classes.
No takes yet. Share an insight, caveat, or question.
Hilaire et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: