Show that any graph having five or fewer vertices and a vertex of degree 2 is planar.

I don't understand the question.

Are they saying 5 or fewer vertices AND 1 vertex with a degree of 2?

5 or fewer vertices with degrees of 2?

Is it asking something else?

If the first, could I put 3 vertices and one with a degree of 2?

If the second, is that possible?

Lastly, beyond drawing a graph, is there any way to show this?

The answer is the back of the book is as follows:

"a graph of five or fewer vertices and a vertex of degree 2 is homeomorphic to a graph with four or fewer vertices. Such a graph cannot contain a homeomorphic copy of $\displaystyle K_{3,3} or K_{5}$ "

Thanks!

Thanks!