Variable degeneracy on toroidal graphs
Abstract
DP-coloring was introduced by Dvo\v{r}\'{a}k and Postle as a generalization of list coloring and signed coloring. A new coloring, strictly -degenerate transversal, is a further generalization of DP-coloring and -forested-coloring. In this paper, we present some structural results on planar and toroidal graphs with forbidden configurations, and establish some sufficient conditions for the existence of strictly -degenerate transversal based on these structural results. Consequently, (i) every toroidal graph without subgraphs isomorphic to the configurations in Fig.2 is DP--colorable, and has list vertex arboricity at most , (ii) every toroidal graph without -cycles is DP--colorable, and has list vertex arboricity at most , (iii) every planar graph without subgraphs isomorphic to the configurations in Fig.3 is DP--colorable, and has list vertex arboricity at most . These results improve upon previous results on DP--coloring [Discrete Math. 341~(7) (2018) 1983--1986; Bull. Malays. Math. Sci. Soc. 43~(3) (2020) 2271--2285] and (list) vertex arboricity [Discrete Math. 333 (2014) 101--105; Int. J. Math. Stat. 16~(1) (2015) 97--105; Iranian Math. Soc. 42~(5) (2016) 1293--1303].
Keywords
Cite
@article{arxiv.1907.07141,
title = {Variable degeneracy on toroidal graphs},
author = {Rui Li and Tao Wang},
journal= {arXiv preprint arXiv:1907.07141},
year = {2025}
}
Comments
11 pages, 5 figures. arXiv admin note: text overlap with arXiv:1907.06630