Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(37)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(28)
Randomized Algorithms
(1)
Recent questions in Graph Theory
Most popular tags
recurrence-relations
time-complexity
asymptotic-analysis
loops
graph
asymptotic-notation
dynamic-programming
greedy
substitution-method
a-star
np-completeness
nested-loops
vertex-coloring
analysis
mdp
log
probability
stochastic
heuristic
master-theorem
markov-model
n-puzzle
csp
graph-coloring
exam
mvcs
small-oh
exponent
proof
viterbi
bayes-rule
hmm
tree-search
grid-world
admissible
n-queens
conflict
ai
clique
coins
reduction
dfs
prime-numbers
sqrt
count
easy
sorted-lists
logn
example
recursive
gcd
independent-set
unsolvable
pcp
counter-example
not-master-theorem
modulus
algebra
most-likely-estimate
reinforcement-learning
direct-evaluation
meu
articulation-point
hotel-room
small-omega
limit-method
mle
graph-search
while-loop
greedy-suboptimal
job-assignment
maximize-value
gold
constraint-satisfaction-problem
8-puzzle
task-environments
min-max
peak
randomized
satisfiability
random-graph-generation
proxy
network
sudoku
branchandbound
d&c
degree-constrained
spanning-tree
vertex-cover
branch
subtree
series
pmi
bound
contradiction
math
backtracking
tree
minimize
floors
Recent questions in Graph Theory
0
votes
3
answers
Give an example of a graph that has 6 vertices, 9 edges, but does not have a clique on 3 vertices
asked
Dec 11, 2023
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
clique
0
votes
1
answer
Example of a graph that is connected, has articulation point, needs 4 colors, and does not have a 4-clique
asked
Dec 10, 2022
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph-coloring
graph
articulation-point
exam
+1
vote
2
answers
Give an example of a graph without an articulation point, a Hamiltonian cycle, or a 2-coloring
asked
Jul 8, 2018
in
Graph Theory
by
basil
Active
(
340
points)
graph
vertex-coloring
graph-coloring
0
votes
2
answers
How to generate a random connected graph?
asked
Oct 15, 2017
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
random-graph-generation
+1
vote
5
answers
Graph with no 3-clique that needs at least 4 colors
asked
Jul 24, 2017
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
vertex-coloring
+2
votes
1
answer
Heap removing and adding
asked
Oct 6, 2016
in
Graph Theory
by
taoran_xue
AlgoStar
(
440
points)
0
votes
2
answers
Graph that has 10 vertices, is 3-colorable and number of edges is maximized
asked
Aug 23, 2016
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
vertex-coloring
example
0
votes
3
answers
Graph Example n >= 6, delta >= 4, ki = 2
asked
Aug 20, 2016
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
vertex-coloring
example
0
votes
3
answers
Color this graph (n=10, m=15)
asked
Aug 15, 2016
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
vertex-coloring
greedy
0
votes
3
answers
symmetry + transitivity => reflexivity, or not?
asked
Jan 18, 2016
in
Graph Theory
by
anonymous
relation
function
+1
vote
1
answer
Polynomial time solution for Constrained Version of Tetris Problem
asked
Jan 14, 2016
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
tetris
dynamic-programming
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
...