Gabriel Sharbel

collaborators

2 papers

math.CO2024

Maximizing Satisfied Vertex Requests in List Coloring

Timothy Bennett, Michael C. Bowdoin, Haley Broadus +5

Suppose $G$ is a graph and $L$ is a list assignment for $G$ . A request of $L$ is a function $r$ with nonempty domain $D \subseteq V (G)$ such that $r (v) \in L (v)$ for each $v \in D$ .…

math.CO2024

On Polynomial Representations of Dual DP Color Functions

Jeffrey A. Mudrock, Gabriel Sharbel

DP-coloring (also called correspondence coloring) is a generalization of list coloring that was introduced by Dvořák and Postle in 2015. The chromatic polynomial of a graph is an i…