A note on kernel-perfect orientations and DP-colorings from derangement assignments
Combinatorics
2024-07-16 v1
Abstract
We prove a generalization of the well-known Bondy-Bopanna-Siegel Lemma to DP-colorings from a class of correspondence assignments which we call derangement assignments. Since DP-colorings from derangement assignments generalize zero-free list colorings of signed graphs, this yields an orientation theorem for zero-free signed list colorings, as well.
Keywords
Cite
@article{arxiv.2407.10007,
title = {A note on kernel-perfect orientations and DP-colorings from derangement assignments},
author = {Ian Gossett},
journal= {arXiv preprint arXiv:2407.10007},
year = {2024}
}
Comments
6 pages