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
0
answers
1
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
by
makhdoom ghaya
18
views
missing-videos
free-videos
video-links
go-classroom
graph-theory
graph-coloring
1
vote
4
answers
2
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$
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
1.8k
views
nielit2017dec-scientistb
discrete-mathematics
graph-theory
graph-coloring
0
votes
4
answers
3
UGC NET CSE | January 2017 | Part 2 | Question: 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
go_editor
asked
in
Graph Theory
Mar 24, 2020
by
go_editor
506
views
ugcnetjan2017ii
graph-theory
graph-coloring
18
votes
6
answers
4
GATE CSE 2020 | Question: 52
Graph $G$ is obtained by adding vertex $s$ to $K_{3,4}$ and making $s$ adjacent to every vertex of $K_{3,4}$. The minimum number of colours required to edge-colour $G$ is _______
Arjun
asked
in
Graph Theory
Feb 12, 2020
by
Arjun
7.9k
views
gatecse-2020
numerical-answers
graph-theory
graph-coloring
0
votes
3
answers
5
TIFR CSE 2020 | Part B | Question: 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)$
Lakshman Patel RJIT
asked
in
Graph Theory
Feb 11, 2020
by
Lakshman Patel RJIT
1.7k
views
tifr2020
engineering-mathematics
graph-theory
graph-coloring
3
votes
2
answers
6
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.
gatecse
asked
in
Graph Theory
Sep 13, 2019
by
gatecse
444
views
cmi2019
graph-theory
graph-coloring
spanning-tree
vertex-cover
descriptive
5
votes
1
answer
7
GATE Overflow | Mock GATE | Test 1 | Question: 51
... 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?
Ruturaj Mohanty
asked
in
Graph Theory
Dec 27, 2018
by
Ruturaj Mohanty
698
views
go-mockgate-1
numerical-answers
discrete-mathematics
graph-coloring
graph-theory
4
votes
1
answer
8
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?
Balaji Jegan
asked
in
Graph Theory
Nov 27, 2018
by
Balaji Jegan
1.4k
views
graph-theory
graph-coloring
combinatory
3
votes
1
answer
9
Zeal Test Series 2019: Graph Theory - Graph Coloring
what is index ?
Prince Sindhiya
asked
in
Graph Theory
Nov 19, 2018
by
Prince Sindhiya
812
views
zeal
graph-theory
graph-coloring
zeal2019
0
votes
0
answers
10
Regular graph coloring
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
dan31
asked
in
Graph Theory
Nov 6, 2018
by
dan31
826
views
graph-theory
graph-coloring
2
votes
1
answer
11
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 _________.
srestha
asked
in
Graph Theory
Sep 21, 2018
by
srestha
822
views
graph-theory
graph-coloring
0
votes
0
answers
12
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
ejaz
asked
in
Graph Theory
Jun 30, 2018
by
ejaz
271
views
graph-coloring
1
vote
2
answers
13
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.
Ayush Upadhyaya
asked
in
Graph Theory
Jun 7, 2018
by
Ayush Upadhyaya
793
views
graph-theory
graph-coloring
27
votes
5
answers
14
GATE CSE 2018 | Question: 18
The chromatic number of the following graph is _____
gatecse
asked
in
Graph Theory
Feb 14, 2018
by
gatecse
8.9k
views
graph-theory
graph-coloring
numerical-answers
gatecse-2018
3
votes
1
answer
15
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?
Shubhanshu
asked
in
Graph Theory
Jan 22, 2018
by
Shubhanshu
1.3k
views
graph-theory
graph-coloring
7
votes
2
answers
16
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph? answer given is 4. Please provide a detailed solution.
kapilbk1996
asked
in
Graph Theory
Jan 11, 2018
by
kapilbk1996
496
views
graph-theory
graph-coloring
made-easy-test-series
madeeasy-testseries-2018
8
votes
0
answers
17
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
Mk Utkarsh
asked
in
Graph Theory
Jan 10, 2018
by
Mk Utkarsh
703
views
graph-theory
discrete-mathematics
graph-connectivity
graph-coloring
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(645)
Exam Queries
(839)
Tier 1 Placement Questions
(17)
Job Queries
(73)
Projects
(9)
Unknown Category
(851)
Recent questions tagged graph-coloring
Recent Blog Comments
"If you are dead tomorrow your GATE rank is not...
@saheb sarkar1997 Please check the Test...
Sir some test due date passed 1-2 months ago pls...
@lalitver10 There is no restriction in doing...
@GateOverflow04 link fixed now.