Some orientation theorems for restricted DP-colorings of graphs
Combinatorics
2024-12-19 v4
Abstract
We define -signable correspondence assignments on multigraphs, which generalize good correspondence assignments as introduced by Kaul and Mudrock. We introduce an auxiliary digraph that allows us to prove an Alon-Tarsi style theorem for DP-colorings from -signable correspondence assignments on multigraphs, and apply this theorem to obtain three DP-coloring analogs of the Alon-Tarsi theorem for arbitrary correspondence assignments as corollaries. We illustrate the use of these corollaries for DP-colorings on a restricted class of correspondence assignments on toroidal grids.
Keywords
Cite
@article{arxiv.2308.12706,
title = {Some orientation theorems for restricted DP-colorings of graphs},
author = {Ian Gossett},
journal= {arXiv preprint arXiv:2308.12706},
year = {2024}
}
Comments
16 pages