Some computational problems have different complexity on different graph classes. For instance, 3-edge coloring is NP-complete on cubic graphs but polynomial on cubic bipartite graphs.
What are the graph problems that have different complexities on directed and mixed graphs.
A mixed graph can have both directed and undirected edges. A perfect answer would be a survey paper of such problems.