Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
In this note we consider two coloring problems in mixed graphs, i.e., graphs containing edges and arcs. We show that they are both -complete in cubic planar bipartite graphs. This answers an open question from \cite{Ries2}.