We study gap-freeness of feasible sets of planar mixed hypergraphs. We address complexity of determining their upper chromatic number.
