Draw a simple undirected graph G!?!
Draw a simple undirected graph G using paint program that has 12 vertices, 18 edges, and 3 connected components. Why would it be impossible to draw G with 3 connected components if G had 66 edges?
Can someone show me how this is done? It will help me with my final preparation.
Can someone show me how this is done? It will help me with my final preparation.
This isn't a programming question and it's rather esoteric so no one may have an answer for you.
Have you tried doing a search for "Euler tTour"???:
http://www.google.com/search?q=euler+tour&ie=utf-8&oe=utf-8&aq=t&rls=org.mozilla:en-US:official&client=firefox-a
Have you tried doing a search for "Euler tTour"???:
http://www.google.com/search?q=euler+tour&ie=utf-8&oe=utf-8&aq=t&rls=org.mozilla:en-US:official&client=firefox-a
Topic archived. No new replies allowed.