Question: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? 

A 2 
B 3 
C 4 
D 6 

+ Answer
D 

+ Report

Md. Habib Ullah

Editor, VCampus

Your Name

Your Email

Type of Report
Spelling MistakeIncorrect AnswerGrammar MistakeContent MissingImproper Text FormatInsufficient AnswerDuplicate QuestionImproper Sentence StructureImproper Equation/FormulaOther

Description