Iskanje po repozitoriju

Opis: 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.
Ključne besede: linear coloring, central coloring, treedepth
Objavljeno v RUP: 25.03.2026; Ogledov: 234; Prenosov: 3
Celotno besedilo (713,67 KB)
Gradivo ima več datotek! Več...