Vertex Colouring Flashcards

1
Q

Colouring :=?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Chromatic Number?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

It is impossible to find a vertex colouring if?

A

G has a loop

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q
A

And only if G is bipartite

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

C_n ?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

G contains an odd cycle as a sub graph implies?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

greedy algorithm

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Brooks theorem

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

X(G) is?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly