Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged graph-coloring
0
votes
4
answers
1
GATE DS&AI 2024 | GA Question: 2
The $15$ parts of the given figure are to be painted such that no two adjacent parts with shared boundaries (excluding corners) have the same color. The minimum number of colors required is $4$ $3$ $5$ $6$
The $15$ parts of the given figure are to be painted such that no two adjacent parts with shared boundaries (excluding corners) have the same color. The...
Arjun
3.3k
views
Arjun
asked
Feb 16
Analytical Aptitude
gate-ds-ai-2024
analytical-aptitude
graph-coloring
+
–
1
votes
3
answers
2
GATE CSE 2024 | Set 2 | Question: 50
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is __________.
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is __________.
Arjun
1.9k
views
Arjun
asked
Feb 16
Graph Theory
gatecse2024-set2
graph-theory
numerical-answers
graph-coloring
+
–
1
votes
0
answers
3
Memory Based GATE DA 2024 | Question: 64
Minimum Number of colors in concentric circles.
Minimum Number of colors in concentric circles.
GO Classes
143
views
GO Classes
asked
Feb 4
Graph Theory
gate2024-da-memory-based
goclasses
graph-theory
graph-coloring
+
–
4
votes
1
answer
4
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 46
Assume the following graph is a labeled graph i.e. every vertex has a unique label. In how many ways can we color the following labeled graph $\mathrm{G}$ with six colors $\{R, G, B, W, Y, M\}$ such that no two adjacent vertices are assigned the same color?
Assume the following graph is a labeled graph i.e. every vertex has a unique label.In how many ways can we color the following labeled graph $\mathrm{G}$ with six colors ...
GO Classes
658
views
GO Classes
asked
Jan 21
Graph Theory
goclasses2024-mockgate-12
goclasses
numerical-answers
graph-theory
graph-coloring
2-marks
+
–
1
votes
1
answer
5
Graph Theory
suryansh rajput
205
views
suryansh rajput
asked
Oct 2, 2023
Graph Theory
graph-theory
discrete-mathematics
graph-coloring
+
–
2
votes
1
answer
6
Chromatic Number
Çșȇ ʛấẗẻ
217
views
Çșȇ ʛấẗẻ
asked
Aug 28, 2023
Graph Theory
graph-theory
graph-coloring
+
–
0
votes
1
answer
7
#Graph Theory
Çșȇ ʛấẗẻ
156
views
Çșȇ ʛấẗẻ
asked
Jun 26, 2023
Mathematical Logic
graph-theory
discrete-mathematics
graph-coloring
+
–
0
votes
1
answer
8
Byju's graph theory coloring question
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ . The find the minimum number of colours required ot edge-colour is ?
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ...
Sahil_Lather
480
views
Sahil_Lather
asked
Apr 15, 2023
Graph Theory
graph-coloring
graph-theory
byjus-practice-book
+
–
3
votes
0
answers
9
TIFR CSE 2023 | Part B | Question: 12
A graph $G=(V, E)$ is said to be $k$-colourable if the set $V$ of vertices can be coloured with $k$ colours such that no edge has both its endpoints of the same colour. It is known that the following language $\text{3COL}$ is $\text{NP}$-complete. \[ 3 \ ... $\text{(P1), (P3)}$and $\text{(P4)}$ Only problems $\text{(P1), (P2)}$and $\text{(P4)}$
A graph $G=(V, E)$ is said to be $k$-colourable if the set $V$ of vertices can be coloured with $k$ colours such that no edge has both its endpoints of the same colour. I...
admin
380
views
admin
asked
Mar 14, 2023
Graph Theory
tifr2023
graph-theory
graph-coloring
p-np-npc-nph
+
–
2
votes
1
answer
10
TIFR CSE 2023 | Part B | Question: 13
You have a regular tetrahedron and $4$ distinct colours. You wish to paint the faces of the tetrahedron such that each face gets a different colour. How many ways can you colour the tetrahedron? Recall that a regular tetrahedron is a three-dimensional ... considered the same if they are identical after possibly rotating the tetrahedron. $24$ $12$ $8$ $6$ $2$
You have a regular tetrahedron and $4$ distinct colours. You wish to paint the faces of the tetrahedron such that each face gets a different colour. How many ways can you...
admin
510
views
admin
asked
Mar 14, 2023
Graph Theory
tifr2023
graph-theory
graph-coloring
+
–
7
votes
3
answers
11
GATE CSE 2023 | Question: 45
Let $G$ be a simple, finite, undirected graph with vertex set $\left\{v_{1}, \ldots, v_{n}\right\}$. Let $\Delta(G)$ denote the maximum degree of $G$ and let $\mathbb{N}=\{1,2, \ldots\}$ denote the set of all possible colors. Color the vertices ... $\Delta(G)$. The number of colors used is equal to the chromatic number of $G$.
Let $G$ be a simple, finite, undirected graph with vertex set $\left\{v_{1}, \ldots, v_{n}\right\}$. Let $\Delta(G)$ denote the maximum degree of $G$ and let $\mathbb{N}=...
admin
8.4k
views
admin
asked
Feb 15, 2023
Graph Theory
gatecse-2023
graph-theory
graph-coloring
multiple-selects
2-marks
+
–
3
votes
0
answers
12
graph theory
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?
Kabir5454
454
views
Kabir5454
asked
Jan 2, 2023
Graph Theory
zeal
graph-theory
discrete-mathematics
graph-coloring
numerical-answers
+
–
1
votes
1
answer
13
DRDO CSE 2022 Paper 1 | Question: 10
Given a tree $\text{T}$ and $\lambda \geq 2$ colours $\left(c_{1}, c_{2}, \ldots, c_{\lambda}\right),$ how many proper colourings of the tree $\text{T}$ are possible?
Given a tree $\text{T}$ and $\lambda \geq 2$ colours $\left(c_{1}, c_{2}, \ldots, c_{\lambda}\right),$ how many proper colourings of the tree $\text{T}$ are possible?
admin
316
views
admin
asked
Dec 15, 2022
Graph Theory
drdocse-2022-paper1
graph-theory
graph-coloring
4-marks
descriptive
+
–
1
votes
0
answers
14
TIFR CSE 2022 | Part B | Question: 12
Given an undirected graph $G$, an ordering $\sigma$ of its vertices is called a perfect ordering if for every vertex $v$, the neighbours of $v$ which precede $v$ in $\sigma$ form a clique in $G$. Recall that given an undirected ... SPECIAL-COLOURING are in $\mathrm{P}$ Neither of SPECIAL-CLiQUE and SPECIAL-COLOURING is in $\mathrm{P},$ but both are decidable
Given an undirected graph $G$, an ordering $\sigma$ of its vertices is called a perfect ordering if for every vertex $v$, the neighbours of $v$ which precede $v$ in $\sig...
admin
382
views
admin
asked
Sep 1, 2022
Graph Theory
tifr2022
graph-theory
graph-coloring
p-np-npc-nph
+
–
0
votes
0
answers
15
Best Open Video Playlist for Graph Theory: Coloring Topic | Discrete Mathematics
Please list out the best free available video playlist for Graph Theory: Coloring Topic from Discrete Mathematics as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO ... ones are more likely to be selected as best. For the full list of selected videos please see here
Please list out the best free available video playlist for Graph Theory: Coloring Topic from Discrete Mathematics as an answer here (only one playlist per answer). We'll ...
makhdoom ghaya
205
views
makhdoom ghaya
asked
Aug 14, 2022
Study Resources
missing-videos
free-videos
video-links
go-classroom
graph-theory
graph-coloring
+
–
2
votes
1
answer
16
TIFR CSE 2021 | Part B | Question: 13
Let $A$ be a $3 \times 6$ matrix with real-valued entries. Matrix $A$ has rank $3$. We construct a graph with $6$ vertices where each vertex represents distinct column in $A$, and there is an edge between two vertices if the two columns represented ... is connected. There is a clique of size $3$. The graph has a cycle of length $4$. The graph is $3$-colourable.
Let $A$ be a $3 \times 6$ matrix with real-valued entries. Matrix $A$ has rank $3$. We construct a graph with $6$ vertices where each vertex represents distinct column in...
soujanyareddy13
610
views
soujanyareddy13
asked
Mar 25, 2021
Graph Theory
tifr2021
graph-theory
graph-coloring
matrix
+
–
3
votes
2
answers
17
TIFR CSE 2021 | Part B | Question: 14
Consider the following greedy algorithm for colouring an $n$-vertex undirected graph $G$ with colours $c_{1}, c_{2}, \dots:$ consider the vertices of $G$ ... $m\left ( n, r \right ) = nr$ $m\left ( n, r \right ) = n\binom{r}{2}$
Consider the following greedy algorithm for colouring an $n$-vertex undirected graph $G$ with colours $c_{1}, c_{2}, \dots:$ consider the vertices of $G$ in any sequence ...
soujanyareddy13
748
views
soujanyareddy13
asked
Mar 25, 2021
Graph Theory
tifr2021
graph-theory
graph-coloring
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register