Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
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$
Arjun
asked
in
Analytical Aptitude
Feb 17
by
Arjun
3.1k
views
gate-ds-ai-2024
analytical-aptitude
graph-coloring
1
vote
0
answers
2
Memory Based GATE DA 2024 | Question: 64
Minimum Number of colors in concentric circles.
GO Classes
asked
in
Graph Theory
Feb 5
by
GO Classes
103
views
gate2024-da-memory-based
goclasses
graph-theory
graph-coloring
4
votes
1
answer
3
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?
GO Classes
asked
in
Graph Theory
Jan 21
by
GO Classes
553
views
goclasses2024-mockgate-12
goclasses
numerical-answers
graph-theory
graph-coloring
2-marks
1
vote
1
answer
4
Graph Theory
suryansh rajput
asked
in
Graph Theory
Oct 2, 2023
by
suryansh rajput
174
views
graph-theory
discrete-mathematics
graph-coloring
2
votes
1
answer
5
Chromatic Number
Çșȇ ʛấẗẻ
asked
in
Graph Theory
Aug 28, 2023
by
Çșȇ ʛấẗẻ
189
views
graph-theory
graph-coloring
0
votes
1
answer
6
#Graph Theory
Çșȇ ʛấẗẻ
asked
in
Mathematical Logic
Jun 26, 2023
by
Çșȇ ʛấẗẻ
125
views
graph-theory
discrete-mathematics
graph-coloring
0
votes
1
answer
7
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 ?
Sahil_Lather
asked
in
Graph Theory
Apr 15, 2023
by
Sahil_Lather
425
views
graph-coloring
graph-theory
byjus-practice-book
3
votes
0
answers
8
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)}$
admin
asked
in
Graph Theory
Mar 14, 2023
by
admin
344
views
tifr2023
graph-theory
graph-coloring
p-np-npc-nph
2
votes
1
answer
9
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$
admin
asked
in
Graph Theory
Mar 14, 2023
by
admin
443
views
tifr2023
graph-theory
graph-coloring
7
votes
3
answers
10
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$.
admin
asked
in
Graph Theory
Feb 15, 2023
by
admin
8.1k
views
gatecse-2023
graph-theory
graph-coloring
multiple-selects
2-marks
3
votes
0
answers
11
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 ?
Kabir5454
asked
in
Graph Theory
Jan 2, 2023
by
Kabir5454
417
views
zeal
graph-theory
discrete-mathematics
graph-coloring
numerical-answers
1
vote
0
answers
12
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?
admin
asked
in
Graph Theory
Dec 15, 2022
by
admin
272
views
drdocse-2022-paper1
graph-theory
graph-coloring
4-marks
descriptive
1
vote
0
answers
13
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
admin
asked
in
Graph Theory
Sep 1, 2022
by
admin
346
views
tifr2022
graph-theory
graph-coloring
p-np-npc-nph
0
votes
0
answers
14
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
makhdoom ghaya
asked
in
Study Resources
Aug 15, 2022
by
makhdoom ghaya
191
views
missing-videos
free-videos
video-links
go-classroom
graph-theory
graph-coloring
2
votes
1
answer
15
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.
soujanyareddy13
asked
in
Graph Theory
Mar 25, 2021
by
soujanyareddy13
555
views
tifr2021
graph-theory
graph-coloring
matrix
3
votes
2
answers
16
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}$
soujanyareddy13
asked
in
Graph Theory
Mar 25, 2021
by
soujanyareddy13
686
views
tifr2021
graph-theory
graph-coloring
Page:
1
2
3
next »
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent questions tagged graph-coloring
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation