Graph Theory 4: Non-Planar Graphs & Kuratowski's Theorem

Forth mini-lecture in Graph Theory Series

[georgelaing]

It's nice to see someone taking time to discuss Kurtowski. It is usually just
mentioned in passing.

[anoopjalla]

when you first drew the peterson subgraph, how did you know which edges to remove intially?

[vector]

You clarified in under eleven minutes what canonical texts have universally obscured.

[frankiezafe]

great video! it's perfect to finish my day!

[SimpleLivingHigherThinking]

thank you for making the concepts so simple and fun !! 😀

[valeriereid]

Brilliant! Thanks for explaining Kuratowski's Theorem.

[Busterblade]

Thank you so much. I was having trouble with this concept really well explained.

[acのchannel]

awesome videos, i finally understand kuratowski ;) thx man

[esxjuvw]

That was extremely helpful, thank you !

[letslearncomputerscience]

thanks this video is not only and makes this concept lucid ...

[JayPatel-xtug]

Thank you for explaining, Great video.

[autogenes]

How did he decide which vertices to delete from the Petersen to create K3, 3?

[SequinBrain]

Does every non-planar graph contain both forbidden Ks, or is Petersen idiosyncratic?

[bryangonzales]

are you witting backward or the camera is just inverted

[aninditasaha]

Sir plz called the planner graph and non planner graph alpha index and gamma index calculation formula of transport network connectivity ??