menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent questions tagged graph-coloring
Recent Blog Comments
hi this pdf have gate prevoius year questions or...
Thanks, dude for sharing your experience !! It...
Congratulations, at least you made it to the...
seems like you really enjoyed the process.......
I wrote an email to IISC regarding JEST 2021 but...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Recent questions tagged graph-coloring
1
vote
4
answers
1
NIELIT 2017 DEC Scientist B - Section B: 52
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is $n(n-1)/2$ $n^{n-2}$ $nx$ $n$
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is $n(n-1)/2$ $n^{n-2}$ $nx$ $n$
asked
Mar 30, 2020
in
Graph Theory
Lakshman Patel RJIT
939
views
nielit2017dec-scientistb
discrete-mathematics
graph-theory
graph-coloring
0
votes
1
answer
2
UGCNET-Jan2017-II: 5
Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $\left | V\left ( G \right ) \right |= n\geq 3$. The which of the following is true? $\text{deg}\left ( v \right )\geq \frac{n}{2}$ for each vertex $v\\$ ... $v$ and $w$ are not connected by an edge All of the above
Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $\left | V\left ( G \right ) \right |= n\geq 3$. The which of the following is true? $\text{deg}\left ( v \right )\geq \frac{n}{2}$ for each vertex $v\\$ ... $v$ and $w$ are not connected by an edge All of the above
asked
Mar 24, 2020
in
Graph Theory
jothee
219
views
ugcnetjan2017ii
graph-theory
graph-coloring
0
votes
3
answers
3
TIFR2020-B-11
Which of the following graphs are bipartite? Only $(1)$ Only $(2)$ Only $(2)$ and $(3)$ None of $(1),(2),(3)$ All of $(1),(2),(3)$
Which of the following graphs are bipartite? Only $(1)$ Only $(2)$ Only $(2)$ and $(3)$ None of $(1),(2),(3)$ All of $(1),(2),(3)$
asked
Feb 11, 2020
in
Graph Theory
Lakshman Patel RJIT
392
views
tifr2020
engineering-mathematics
graph-theory
graph-coloring
2
votes
1
answer
4
CMI2019-A-7
An interschool basketball tournament is being held at the Olympic sports complex. There are multiple basketball courts. Matches are scheduled in parallel, with staggered timings, to ensure that spectators always have some match or other available to watch. Each match ... solve? Find a minimal colouring. Find a minimal spanning tree. Find a minimal cut. Find a minimal vertex cover.
An interschool basketball tournament is being held at the Olympic sports complex. There are multiple basketball courts. Matches are scheduled in parallel, with staggered timings, to ensure that spectators always have some match or other available to watch. Each match requires a ... to solve? Find a minimal colouring. Find a minimal spanning tree. Find a minimal cut. Find a minimal vertex cover.
asked
Sep 13, 2019
in
Graph Theory
gatecse
225
views
cmi2019
graph-theory
graph-coloring
spanning-tree
vertex-cover
descriptive
4
votes
0
answers
5
GO2019-FLT1-51
... Consider the above given adjacency matrix representation of a graph containing $7$ nodes (namely A , B, C, D, E, F, G). The Chromatic number of the given graph is?
... $7$ nodes (namely A , B, C, D, E, F, G). The Chromatic number of the given graph is?
asked
Dec 27, 2018
in
Graph Theory
Ruturaj Mohanty
337
views
go2019-flt1
numerical-answers
discrete-mathematics
graph-coloring
graph-theory
4
votes
1
answer
6
Graph Coloring
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ? There is a condition that adjacent vertices should not be of the same color I am getting $1680$. Is it correct?
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ? There is a condition that adjacent vertices should not be of the same color I am getting $1680$. Is it correct?
asked
Nov 27, 2018
in
Graph Theory
Balaji Jegan
750
views
graph-theory
graph-coloring
combinatory
2
votes
1
answer
7
Zeal Test Series 2019: Graph Theory - Graph Coloring
what is index ?
what is index ?
asked
Nov 19, 2018
in
Graph Theory
Prince Sindhiya
520
views
zeal
graph-theory
graph-coloring
zeal2019
0
votes
0
answers
8
Regular graph coloring
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
asked
Nov 6, 2018
in
Graph Theory
dan31
478
views
graph-theory
graph-coloring
1
vote
1
answer
9
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 _________.
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
Sep 21, 2018
in
Graph Theory
srestha
379
views
graph-theory
graph-coloring
0
votes
0
answers
10
How to find even or odd cylce in a graph
Consider this example , There is even vertices cycle as well as odd vertices cycle as per my understanding, let me know if it correct. Thanks a lot
Consider this example , There is even vertices cycle as well as odd vertices cycle as per my understanding, let me know if it correct. Thanks a lot
asked
Jun 30, 2018
in
Graph Theory
ejaz
140
views
graph-coloring
1
vote
2
answers
11
Self-Doubt regarding Graph Coloring
This has reference to the below question https://gateoverflow.in/204092/gate2018-18?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.
This has reference to the below question https://gateoverflow.in/204092/gate2018-18?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 and b with colour 2 ... and how 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, 2018
in
Graph Theory
Ayush Upadhyaya
325
views
graph-theory
graph-coloring
0
votes
1
answer
12
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^{n-1})}$ $\dfrac{1}{n}$ $\dfrac{2}{n}$ $\dfrac{3}{n}$
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^{n-1})}$ $\dfrac{1}{n}$ $\dfrac{2}{n}$ $\dfrac{3}{n}$
asked
Mar 16, 2018
in
Graph Theory
RahulRoy31
136
views
graph-theory
graph-coloring
21
votes
5
answers
13
GATE2018-18
The chromatic number of the following graph is _____
The chromatic number of the following graph is _____
asked
Feb 14, 2018
in
Graph Theory
gatecse
5.4k
views
graph-theory
graph-coloring
numerical-answers
gate2018
3
votes
1
answer
14
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?
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 _________. In the ... than 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, 2018
in
Graph Theory
Shubhanshu
626
views
graph-theory
graph-coloring
6
votes
2
answers
15
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
answer given is 4. Please provide a detailed solution.
answer given is 4. Please provide a detailed solution.
asked
Jan 11, 2018
in
Graph Theory
kapilbk1996
291
views
graph-theory
graph-coloring
made-easy-test-series
madeeasy-testseries-2018
7
votes
0
answers
16
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
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, 2018
in
Graph Theory
Mk Utkarsh
461
views
graph-theory
discrete-mathematics
graph-connectivity
graph-coloring
0
votes
0
answers
17
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
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
akb1115
120
views
graph-theory
graph-coloring
1
vote
0
answers
18
#GRAPH THEORY
asked
Dec 23, 2017
in
Graph Theory
Abhijeet_Kumar
219
views
graph-theory
discrete-mathematics
graph-coloring
24
votes
6
answers
19
TIFR2018-A-9
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$
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
Rohit Gupta 8
2.2k
views
tifr2018
graph-theory
graph-coloring
1
vote
2
answers
20
#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
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
Harish Karnam
327
views
graph-theory
graph-coloring
Page:
1
2
next »
...