The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged graphcoloring
0
votes
1
answer
1
Graph Coloring
A vertex colouring with four colours of a graph G = (V, E) is a mapping V → {R, G, B, Y }. So that any two adjacent vertices does not same colour. Consider the below graphs: The number of vertex colouring possible with 4 colours are _________.
asked
3 days
ago
in
Graph Theory
by
srestha
Veteran
(
96.1k
points)

50
views
graphtheory
graphcoloring
0
votes
0
answers
2
How to find even or odd cylce in a graph
asked
Jun 30
in
Graph Theory
by
ejaz
(
217
points)

28
views
graphcoloring
0
votes
2
answers
3
SelfDoubt regarding Graph Coloring
This has reference to the below question https://gateoverflow.in/204092/gate201818?show=204092#q204092 My doubt is Suppose, I try to colour the vertices of this graph as follows First I colour vertex a and f with colour 1. Then I colour vertex e ... what points in mind do I need to remember so that I can colour any given graph with the minimum number of colours.
asked
Jun 7
in
Graph Theory
by
Ayush Upadhyaya
Boss
(
12.5k
points)

85
views
graphtheory
graphcoloring
0
votes
1
answer
4
GraphTheory_Problem_testpaper
Consider the undirected graph $G$ defined as follows. The vertices of $G$ are bits of strings of length $n$. We have an edge between vertex $u$ and $v$ if and only if $u$ and $v$ differ exactly in one bit position. The ratio of chromatic number of $G$ to the diameter of $G$ is . $\dfrac{1}{(2^{n1})}$ $\dfrac{1}{n}$ $\dfrac{2}{n}$ $\dfrac{3}{n}$
asked
Mar 16
in
Graph Theory
by
RahulRoy31
(
199
points)

75
views
graphtheory
graphcoloring
+7
votes
4
answers
5
GATE201818
The chromatic number of the following graph is _____
asked
Feb 14
in
Graph Theory
by
gatecse
Boss
(
18.1k
points)

1.6k
views
graphtheory
graphcoloring
numericalanswers
gate2018
+3
votes
1
answer
6
Graph Coloring
A vertex colouring with four colours of a graph G = (V, E) is a mapping V → {R, G, B, Y }. So that any two adjacent vertices does not same colour. Consider the below graphs: The number of vertex colouring possible with 4 colours are _________. ... Red and D with also blue which is other than Green, now this case is clearly violating graph coloring property. How, to solve this one?
asked
Jan 22
in
Graph Theory
by
Shubhanshu
Boss
(
15.2k
points)

125
views
graphtheory
graphcoloring
+3
votes
0
answers
7
Graph Colouring
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is
asked
Jan 10
in
Graph Theory
by
Mk Utkarsh
Boss
(
17k
points)

122
views
graphtheory
discretemathematics
graphconnectivity
graphcoloring
0
votes
0
answers
8
Test Series
Consider the following graph: Which of the following will represents the chromatic number of the graph? I think ans has to be 3 but given as 4
asked
Dec 24, 2017
in
Graph Theory
by
akb1115
Active
(
3.2k
points)

46
views
graphtheory
graphcoloring
+1
vote
0
answers
9
#GRAPH THEORY
asked
Dec 23, 2017
in
Graph Theory
by
Abhijeet_Kumar
Junior
(
817
points)

96
views
graphtheory
discretemathematics
graphcoloring
+9
votes
2
answers
10
TIFR2018A9
How many ways are there to assign colours from range $\left\{1,2,\ldots,r\right\}$ to vertices of the following graph so that adjacent vertices receive distinct colours? $r^{4}$ $r^{4}  4r^{3}$ $r^{4}5r^{3}+8r^{2}4r$ $r^{4}4r^{3}+9r^{2}3r$ $r^{4}5r^{3}+10r^{2}15r$
asked
Dec 10, 2017
in
Graph Theory
by
Rohit Gupta 8
Active
(
2.1k
points)

363
views
tifr2018
graphtheory
graphcoloring
+1
vote
2
answers
11
#Graph theory #coloring
How to find number of ways for coloring a graph with 'm' colors for following graphs a)connected graph(with no cycles) b)regular graph
asked
Nov 21, 2017
in
Graph Theory
by
Harish Karnam
Active
(
1.2k
points)

133
views
graphtheory
graphcoloring
+1
vote
0
answers
12
chromatic number
Let G be a planar Graph Such that every phase is bordered by exactly 3 edges which of the following can never be value for X(G) a)2 b)3 C)4 d)none of these
asked
Nov 11, 2017
in
Graph Theory
by
Parshu gate
Active
(
4.9k
points)

175
views
graphtheory
discretemathematics
graphconnectivity
graphmatching
graphcoloring
0
votes
0
answers
13
GRAPH THEORY EDGE COLORING
asked
Nov 5, 2017
in
Algorithms
by
Parshu gate
Active
(
4.9k
points)

107
views
graphtheory
graphcoloring
edgecoloring
0
votes
0
answers
14
Chromatic polynomials
Check which of the following can be chromatic polynomials of a nonnull graph ? i) x5  4x3  2x2 + x + 4 ii) x6  3x5 + 2x4  1 P.S I know for a nonnull graph G, X(G) (i.e. chromatic number) is at least 2. How to proceed further ??
asked
Oct 24, 2017
in
Mathematical Logic
by
just_bhavana
Boss
(
12k
points)

77
views
graphtheory
graphcoloring
0
votes
2
answers
15
#Chromatic number , Planarity
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number of G) a) 2 b) 3 c) 4 d) None of these PS : (Explain: "every face is bordered by exactly 3 edges. ")
asked
Jan 11, 2017
in
Graph Theory
by
smartmeet
Active
(
4.9k
points)

148
views
graphtheory
discretemathematics
graphcoloring
0
votes
3
answers
16
Test series
The Chromatic Number of Cycle Graph with 7 vertices _____
asked
Jan 9, 2017
in
Graph Theory
by
Jason GATE
Active
(
3.6k
points)

228
views
gateforumtestseries
graphtheory
graphcoloring
+13
votes
2
answers
17
TIFR2017B10
A vertex colouring of a graph $G=(V, E)$ with $k$ coulours is a mapping $c: V \rightarrow \{1, \dots , k\}$ such that $c(u) \neq c(v)$ for every $(u, v) \in E$. Consider the following statements: If every vertex in $G$ has degree at most $d$ then ... the above statements is/are TRUE? Choose from the following options: only i only i and ii only i and iii only ii and iii i, ii, and iii
asked
Dec 23, 2016
in
Graph Theory
by
jothee
Veteran
(
101k
points)

399
views
tifr2017
graphtheory
graphcoloring
+20
votes
3
answers
18
TIFR2017B1
A vertex colouring with three colours of a graph $G=(V, E)$ is a mapping $c: V \rightarrow \{R, G, B\}$ so that adjacent vertices receive distinct colours. Consider the following undirected graph. How many vertex colouring with three colours does this graph have? $3^9$ $6^3$ $3 \times 2^8$ $27$ $24$
asked
Dec 23, 2016
in
Graph Theory
by
jothee
Veteran
(
101k
points)

590
views
tifr2017
graphtheory
graphcoloring
0
votes
1
answer
19
Algocoloring
Consider a tree with n nodes, where a node can be adjacent to maximum 4 other nodes.Then the minimum number of color needed to color the tree, so that no two adjacent node gets same color?
asked
Dec 9, 2016
in
Algorithms
by
srestha
Veteran
(
96.1k
points)

114
views
graphcoloring
+2
votes
2
answers
20
Made easy
What is the chromatic number of following graphs? 1) 2)
asked
Aug 10, 2016
in
Graph Theory
by
gaurav9822
(
263
points)

120
views
graphcoloring
discrete
engineeringmathematics
+1
vote
1
answer
21
Calculate chromatic number
Shiva draws a tree of N nodes, where a node can be adjacent to maximum of 4 other nodes. What is the minimum number of colors Shiva should use so that no two adjacent nodes get the same color? A. 5 B. 4 C. 3 D. 2 // Please explain how to solve this?
asked
Jul 12, 2016
in
Programming
by
sh!va
Boss
(
34.5k
points)

299
views
algorithms
datastructure
graphcoloring
0
votes
1
answer
22
chromatic number
asked
Jul 7, 2016
in
Graph Theory
by
Imarati Gupta
Junior
(
519
points)

337
views
graphtheory
graphcoloring
+3
votes
1
answer
23
UGCNETJune2012III31
The upper bound of computing time of m colouring decision problem is $O(nm)$ $O(n^m)$ $O(nm^n)$ $O(n^mm^n)$
asked
Jul 7, 2016
in
Programming
by
jothee
Veteran
(
101k
points)

319
views
ugcnetjune2012iii
graphs
graphcoloring
+1
vote
3
answers
24
UGCNETJune2012II4
The number of colours required to properly colour the vertices of every planer graph is 2 3 4 5
asked
Jul 4, 2016
in
Graph Theory
by
jothee
Veteran
(
101k
points)

1.4k
views
ugcnetjune2012ii
graphtheory
graphcoloring
+5
votes
2
answers
25
ISRO200707
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is 1 k k1 k/2
asked
Jun 10, 2016
in
Graph Theory
by
jothee
Veteran
(
101k
points)

2.1k
views
isro2007
graphtheory
graphcoloring
+1
vote
4
answers
26
IISCCSAResearchTest10
A proper vertex colouring of a graph $G$ is a colouring of the vertices in $G$ in such a way that two vertices get different colours if they are adjacent. The minimum number of colours required for proper vertex colouring of $G$ is called the chromatic number of $G$. Then what is the chromatic number of the cycle graph on 149 vertices?
asked
Jun 8, 2016
in
Graph Theory
by
jothee
Veteran
(
101k
points)

218
views
iisccsaresearch2016
descriptive
graphtheory
graphcoloring
iiscinterview
+2
votes
0
answers
27
CMI2015A04b
A college prepares its timetable by grouping courses in slots A, B, C, . . . All courses in a slot meet at the same time, and courses in different slots have disjoint timings. Course registration has been completed and the administration now knows ... of courses with an overlapping audience. In this setting, the graph theoretic question to be answered is: Find a minimal colouring.
asked
May 29, 2016
in
Graph Theory
by
jothee
Veteran
(
101k
points)

148
views
cmi2015
descriptive
graphtheory
graphcoloring
+3
votes
1
answer
28
CMI2015A03
Suppose each edge of an undirected graph is coloured using one of three colours — red, blue or green. Consider the following property of such graphs: if any vertex is the endpoint of a red coloured edge, then it is either an endpoint of a blue coloured edge ... endpoint of any blue coloured edge but is an endpoint of a green coloured edge and a red coloured edge. (A) and (C).
asked
May 27, 2016
in
Graph Theory
by
jothee
Veteran
(
101k
points)

101
views
cmi2015
graphtheory
graphcoloring
+1
vote
1
answer
29
CMI2011B01a
A multinational company is developing an industrial area with many buildings. They want to connect the buildings with a set of roads so that: Each road connects exactly two buildings. Any two buildings are connected via a sequence of roads. Omitting any road ... it always possible to colour each building with either red or blue so that every road connects a red and blue building?
asked
May 19, 2016
in
Graph Theory
by
jothee
Veteran
(
101k
points)

64
views
cmi2011
descriptive
graphcoloring
Page:
1
2
next »
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
Recent Posts
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Discrete Mathematics GO Classroom
Digital Logic GO Classroom
Follow @csegate
Gatecse
Recent questions tagged graphcoloring
Recent Blog Comments
@Arjun sir how to remove such post? should i hide...
[email protected]
.Plz do share @Sanjay sharma
Please post it as question
This is blog area post it as question
[email protected]
39,778
questions
46,781
answers
140,752
comments
58,672
users