Register
Dark Mode

UGC NET CSE | June 2012 | Part 2 | Question: 4

in Graph Theory
9,619 views
1 vote
1 vote

The number of colours required to properly colour the vertices of every planer graph is

  1. 2
  2. 3
  3. 4
  4. 5
in Graph Theory
by
9.6k views

2 Answers

3 votes
3 votes
Best answer

According to the 4-color theorem states that the vertices of every planar graph can be colored with at most 4 colors so that no two adjacent vertices receive the same color.

Hence,Option(C)4 is the correct choice

selected by
by

2 Comments

by
This is for region not vertices correct anser is 5
0
0
by

Vinit Dhull 1  can you prove your point?

0
0
0 votes
0 votes
acc. to 4-color theorem 4 colours are needed to color any simple graph

https://en.wikipedia.org/wiki/Four_color_theorem
by
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!