Question

■ Can a simultaneous embedding with fixed edges for two given graphs be found in polynomial time?

■ Briefly Explain.

Answer 1

which programming language do you study?

Answer 2

Answer:

. When simultaneous embeddings with fixed edges do exist, they can be found in polynomial time for pairs of outerplanar graphs, and for Biconnected graphs, i.e. pairs of graphs whose intersection is biconnected.

pls mark as brainliest