2 problems

Let $H$ be a simple graph. In Max Partial $H$-Coloring\, the input is a graph $G$ with a revenue function $\mathsf{rev}:V(G)\times V(H)\to\mathbb{Q}_{\geq 0}$, an…

Woodall's chromatic conjecture. For every $s,t \in \mathbb{N}$, if $G$ is a graph with $G \not\succeq K_{s,t}$, then