X


Connectivity




Q. ind the cut vertices and cut edges in the graph G1 shown below




Euler Paths and Circuits





Planar Graphs




Q. Suppose that a connected planar simple graph has 20 vertices, each of degree 3. Into how many regions does a representation of this planar graph split the plane?



Theories of Planar Graphs



Graph Coloring



Q. Scheduling Final Exams: How can the final exams at a university be scheduled so that no student has two exams at the same time?


Previous Next