Ries, Bernard 2010 In this note we consider two coloring problems in mixed graphs, i.e., graphs containing edges and arcs, which arise from scheduling problems where disjunctive and precedence constraints have to be taken into account. We show that they are both NP-complete in cubic planar bipartite mixed graphs, which strengthens some results of Ries and de Werra (2008) [9]. application/pdf https://folia.unifr.ch/global/documents/307706 https://folia.unifr.ch/documents/307706/files/coloringmixedgraphsiii.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2009.10.016 info:eu-repo/semantics/openAccess License undefined Discrete Applied Mathematics. - 2010, vol. 158, no. 5, p. 592-596 Applied Mathematics Discrete Mathematics and Combinatorics info:eu-repo/classification/udc/004 Complexity of two coloring problems in cubic planar bipartite mixed graphs http://purl.org/coar/resource_type/c_6501