What are Planar Graphs? | Graph Theory

Hello sir, please explain weakly modular graphs and its properties
!

Thank you very much

Please explain Cage- amalgamation graph, how we cane find it?
thanks

You just saved my assignment's life, Thank you!

Interesting thing about thus topic is that any nonplaner graph , Must containe any of K3,3 or K5 or both....

well explained :)

You look like a slightly nerdier Will wood

can we use euler formula to prove a graph is plannar?

Thamkyou

Wow nice explanation.. ❤️

you look like logic

I sit in class feeling like a failure for not being able to understand this stuff, and then you clear up the topic nearly every time. Your series on graph theory have been an absolute savior. You are so good at describing these concepts, I wouldn't be surprised if you used a teleprompter! Such elegant explanations.

jeeeeeez, the two moments you came up with EulerIdentity and examples of non-planar are just amaaaaaaaaazing!!! How interesting they are woah!

exams are in a week. This channel helped me a lot. Especially when my teacher made all of discrete math seem so complicated when it was just this simple and understandable. Thanks a lot man.

Thank you so much! I have an exam tomorrow and you are a life saver!

Super

very very informative

wow ! why werent you my TA in school for the Graph Theory course ! loved your video this is absolutely awesome. BTW - How is it possible to draw K33 on a coffee cup , wouldnt I still end up crossing the final edge ? ( or am I doing something goofy like .. drawing over the handle of the cup ?)

Superb

I was looking at a couple of graph theory primers, and they both started with geographic areas. They mentioned the edges couldn't cross. What I want to know is Why the edges can't cross. What am I missing?

Thank you

very clear !

You are a great great person. Thank you

Do you have any interest in graceful graphs? If so, I suggest a video on the classes which have been proven graceful. I haven't dug into those proofs myself, but I assume they're difficult. However, many classes have been proven by construction, or in other words, an algorithm for labeling the vertices. That makes it easy to demonstrate the algorithm on examples, even if the formal proof is too difficult to explain. Just another thought. As always, take it or leave it. Keep enjoying the math and stay swanky!

Idea: Take a simple proof and complexify it so much

This video came out a few days after my discrete math final lol I needed this