Linear colorings of graphs
By: Claire Hilaire , Matjaž Krnc , Martin Milanič and more
Potential Business Impact:
Makes computer problems easier to solve.
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.
Similar Papers
Odd coloring graphs with linear neighborhood complexity
Combinatorics
Makes some tricky math problems easier to solve.
Chromatic Feature Vectors for 2-Trees: Exact Formulas for Partition Enumeration with Network Applications
Data Structures and Algorithms
Helps computer networks avoid total failure.
On the Parameterized Complexity of Odd Coloring
Data Structures and Algorithms
Colors graph so neighbors have odd color counts.