Michael C. Bowdoin

collaborators

2 papers

math.CO2025

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.CO2025

An Ohba-like Result for Flexible List Coloring

Michael C. Bowdoin, Yanghong Chi, Christian B. Ellington +4

Chromatic-choosability is a notion of fundamental importance in list coloring. A graph $G$ is chromatic-choosable when its chromatic number, $χ (G)$ , is equal to its list chromatic…