

InterviewSolution
Saved Bookmarks
1. |
What is the number of edges of the greatest planar subgraph of K3,2 where m,n≤3?(a) 18(b) 6(c) 128(d) 702I have been asked this question in an internship interview.This interesting question is from Planarity, Degree and Coloring of Graph in division Graphs of Discrete Mathematics |
Answer» The CORRECT OPTION is (b) 6 |
|