using this for the new IB math HL course. Thank you so much (i am doing the math application and interpretation HL course, so we have to do graph theory)
Plsss to answer us🥺 color the following graph according to the given colors:red,blue,green, yellow.(before coloring the graph, please read first the definition of the four color theorem)
In the second graph, 4->5->1->2->3->4 We are starting at 4 returning to 4 without edge repeating.This is Euler graph @vivekanand khyade or are you missing to say that every edge should be covered?
According to the path you constructed, the edge 2-4 is yet to be visited. But, an Euler Path must include ALL the edges visited in any order. If atleast one edge is still left, then the path you just constructed is a SIMPLE path and not an EULER path. Feel free to drop more queries.
you are nice bro...................really you can explain the the whole concept thank you..................my lovely lecturer i get in my life nice!!!!!!!!!!!!!!!!!!!! please make lecture 1 .Data structure and algorithms 2. computer organization 3.computer graphics and java programming language
thank for excellence lecture sir,, your teaching is so nice and clear. i mean do understand it well properly... thank you so much sir... From Philippines