**Combinatorial and Discrete Geometry: Sheet G**

Prepared by:

Joseph Malkevitch

Department of Mathematics and Computer Studies

York College (CUNY)

Jamaica, New York 11451

email: joeyc@cunyvm.cuny.edu

web page: http://www.york.cuny.edu/~malk

1. For each graph below state which of the following classes of graphs the graph shown belongs to. Note that a given graph may belong to several classes:

(i) a. complete bipartite b. tree c. path d. plane e. complete f. cycle g. bipartite h. triangulated polygon.

(ii) For each graph below draw the graph with the vertex 3 removed.

(iii) For each graph, if possible find a path which starts at vertex 0 and ends at vertex 4 of length 6.

G H

I J

K L

M N