39. Detection Of Planarity Of Graph by Elementary Reduction

[@sanyamsinghal7992]

thanks a lot for the short and precise lectures.

[@Dresseurdecode]

Please, do these steps work for peterson graph?

[@barunpathak9755]

For Kuratowski's Second graph e=9 n=6 then e

[@priyankaaggarwal32]

Coz it doesn't satisfy the 2nd condition of planarity e

[@MegaSauhard]

if we remove the vertices how it is gonna be a k5 and k3,3 graph?

[@PrasantaMondal-xi1gz]

mam in this example all the edges cross each ones so how can this be a planner graph??

[@Tbm4545]

I have the same doubt, this is not a planar graph.

[@AloneDefaulter]

Please Hindi mein bna diya krein. Literally bohut mushkil ho rhi samajhne mein. BTW thanks mam.

[@priyankaaggarwal32]

I m having doubt that the example that u give in this. This doest satisfy the secound condition of planarity e

[@Tbm4545]

U r wrong, there r 2 types of graph the formula u r saying is for bipertite graph.

[@iucampus9623]

Thank you ma'am

[@manashpratim7306]

thank you maam

[@Tbm4545]

How can this be a planar graph the edges are crossing each other.

[@sanjaysridharan642]

Narsingh Deo Graph theory book I guess thats what is used in this video for explanation like as such...........

[@Salman-rv6tg]

Thanku 😍

[@AmarjeetSingh-bc4jl]

Thanks

[@dc00708]

Narsingh deo ke book se chap diye ho

[@shubhamk840]

thanks