MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Collinear Points

The minimum n...

Question

The minimum number of colours that is sufficient to vertex-colour any planar graph is

Open in App

Solution

Four colour theorem says that every planar graph can color with 4 colors i.e. four colors are sufficient to properly color any planar graph.

Suggest Corrections

thumbs-up

0

Similar questions

Q. Graph G is obtained by adding vertex s to

K_{3, 4}

and making s adjacent to every vertex of

K_{3, 4} .

The minimum number of colours required to edge-colour G is

Q. The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same colour, is

Q. What is the minimum number of colours required to fill the spaces in the given diagram without any two adjacent spaces having the same colour?

Q. The Minimum number of colours required to paint all the sides of a cube that no two adjacent faces may have the same colours is:

Q. Mala has a colouring book in which each English letter is drawn two times. She wants to paint each of these 52 prints with one of k colours, such that the colour-pairs used to colour any two letters are diffrent. Both prints of a letter can also be coloured with the same colour. What is the minimum value of k that satiesfies this requirment ?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Lecture - 13

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Collinear Points

Standard VI Mathematics

Join BYJU'S Learning Program

CrossIcon