Remember
Register
Algorithms Q&A
Smart HCM Software
Get the course textbook
Questions
Unanswered
Ask a Question
Lecture Notes
Not Exponential, on Twitter
Most popular tags
timecomplexity
asymptoticnotation
recurrencerelations
loops
graph
asymptoticanalysis
dynamicprogramming
vertexcoloring
analysis
npcompleteness
greedy
log
exponent
mvcs
vertexcover
mastertheorem
smalloh
nestedloops
sortedlists
example
recursive
satisfiability
graphcoloring
randomgraphgeneration
proxy
network
substitutionmethod
branchandbound
d&c
degreeconstrained
spanningtree
reduction
dfs
subtree
primenumbers
sqrt
lecture1
math
tree
count
minimize
floors
array
median
knapsack
trichotomy
eggs
searching
function
relation
gcd
tetris
Recent questions tagged vertexcoloring
0
votes
2
answers
Prove that 3Coloring is NP Hard (starting with SAT as known NP hard problem)
asked
Nov 29, 2017
in
NPCompleteness
by
Amrinder Arora
(
230
points)
npcompleteness
vertexcoloring
satisfiability
0
votes
0
answers
Graph with no 3clique that needs at least 4 colors
asked
Jul 24, 2017
in
Graph Theory
by
Amrinder Arora
(
230
points)
graph
vertexcoloring
0
votes
2
answers
Graph that has 10 vertices, is 3colorable and number of edges is maximized
asked
Aug 23, 2016
in
Graph Theory
by
Amrinder Arora
(
230
points)
graph
vertexcoloring
example
0
votes
3
answers
Graph Example n >= 6, delta >= 4, ki = 2
asked
Aug 20, 2016
in
Graph Theory
by
Amrinder Arora
(
230
points)
graph
vertexcoloring
example
0
votes
3
answers
Color this graph (n=10, m=15)
asked
Aug 15, 2016
in
Graph Theory
by
Amrinder Arora
(
230
points)
graph
vertexcoloring
greedy
To see more, click for the
full list of questions
or
popular tags
.
The Book: Analysis and Design of Algorithms

Presentations on Slideshare

Lecture Notes, etc
...