MCQs>IT & Programming>Data Structures And Algorithms>What is the minimum number of edges which must be removed from a complete bipartite graph of six nodes K(6) so that the remaining graph is a planar?
Data Structures And Algorithms MCQs
What is the minimum number of edges which must be removed from a complete bipartite graph of six nodes K(6) so that the remaining graph is a planar?
Answer
Correct Answer: 6
Explanation:
Note: This Question is unanswered, help us to find answer for this one