A planar graph with more than 2 vertices and no cliques. Indicate the smallest and largest possible

Question:

A planar graph with more than 2 vertices and no cliques.

Indicate the smallest and largest possible chromatic number of the graph described.

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: