Résumé en anglais

In this note we consider previous termtwo coloring problemsnext term in previous termmixed graphs, i.e., graphsnext term containing edges and arcs, which arise from scheduling previous termproblemsnext term where disjunctive and precedence constraints have to be taken into account. We show that they are both View the MathML source-complete in previous termcubic planar bipartite mixed graphs,next term which strengthens some results of Ries and de Werra (2008) [9].