Cover and variable degeneracy
arXiv:1907.06630 · doi:10.1016/j.disc.2021.112765
Abstract
Let be a nonnegative integer valued function on the vertex set of a graph. A graph is \textbf{strictly -degenerate} if each nonempty subgraph has a vertex such that . In this paper, we define a new concept, strictly -degenerate transversal, which generalizes list coloring, signed coloring, DP-coloring, -forested-coloring, and -partition. A \textbf{cover} of a graph is a graph with vertex set , where ; the edge set , where is a matching between and . A vertex set is a \textbf{transversal} of if for each . A transversal is a \textbf{strictly -degenerate transversal} if is strictly -degenerate. The main result of this paper is a degree type result, which generalizes Brooks' theorem, Gallai's theorem, degree-choosable result, signed degree-colorable result, and DP-degree-colorable result. We also give some structural results on critical graphs with respect to strictly -degenerate transversal. Using these results, we can uniformly prove many new and known results. In the final section, we pose some open problems.
arXiv comment18 pages, 5 figures
References in corpus (6)
- The asymptotic behavior of the correspondence chromatic number
- DP-colorings of graphs with high chromatic number
- The Johansson--Molloy Theorem for DP-Coloring
- DP-4-coloring of planar graphs with some restrictions on cycles
- Analogue of DP-coloring on variable degeneracy and its applications on list vertex-arboricity and DP-coloring
- Variable degeneracy on toroidal graphs