GATE CSE 1987 | Question: 2e

Question

State whether the following statement is TRUE or FALSE:

There is a linear-time algorithm for testing the planarity of finite graphs.

Comments

https://gateoverflow.in/208494/dfs-modification

---

Havel hakimi : O($n^{2}$)

Erdos Gallai : O($n \times log(n)$)

 

So the answer is NO

Answer 1

True

http://stackoverflow.com/questions/1854711/how-to-check-if-a-graph-is-a-planar-graph-or-not