Q1- Draw a 3-regular bipartite graph that is not K3,3 ?
Q2- For each of the platonic graphs, is it possible to trace a tour of all vertices by starting at one vertex, traveling only along edges, never revisiting a vertex, and never lifting the pen off the paper? Is it possible to make the tour return to the starting vertex?
Q3- A. Draw all the 3-vertex tournaments whose vertices are u,v,x ?
B. Determine the number of 4-vertex tournaments whose vertices are u,v,x,y ?