We study mixed hypergraphs with bounded degree and complexity of determining gap-freenes of feasibel sets of general mixed hypergraphs.
