However , for three or more graphs , the problem is NP - complete .
It is an open question whether the existence of a simultaneous embedding with fixed edges for two given graphs can be tested in polynomial time .
For three or more graphs , the problem is NP - complete .
It is an open question whether the existence of a simultaneous embedding with fixed edges for two given graphs can be tested in polynomial time .