Graph Theory

Fall 2018

Lecture 12: Graph Coloring - I

November 12, 2018

Wajahat Ali Khan

Department of Computer Science and Engineering
Kyung Hee University
1. What is a graph?
Contents
a. What is a Graph? a. Testing for Planarity
b. Definitions and Examples b. Thickness
2. Eulerian Graphs c. Duality
a. Eulerian Trails and Circuits 7. Coloring Graphs
a. Dominant Sets, independence and Cliques
b. Postman Problems
b. Vertex coloring, edge coloring
3. Hamiltonian Graphs c. Chromatic polynomial
a. Elementary Existence Theorems d. Coloring Maps
b. The Traveling Salesperson Problem e. 4-color theorem, 5-color theorem
4. Path Algorithms 8. Connectivity
a. Edge Connectivity
a. The shortest Path Algorithms
b. Vertex Connectivity
b. The Longest Path Algorithms c. Menger’s Theorems and Connectivity
c. Transitive Closure Algorithm 9. Networks and Flows
d. Biconnectivity a. Networks and Flows
e. Depth-Fist Search b. Maximum flow Problem
c. Multi-Commodity Flow Problem
f. Breadth-First Search
d. Minimum Cost Flow Algorithm
5. Trees e. Circulation Problem
a. Spanning Trees 10. Matchings
b. Centers and Bicenters a. Definitions
c. Binary Trees b. Maximum Matchings
c. Maximum Weight Matchings
d. Counting Trees
d. factor
e. Searching Trees 11. Graph and Np-Completeness
6. Planar Graph a. NP-Completeness
a. Euler’s Formula b. NP-Complete Problems in Graph 2

b. Genus
 South America

3
Introduction to Graph Theory by University of California San Diego & National Research University Higher School of Economics - Coursera
 Dominating Set
Definition: a dominating set for a graph G = (V, E) is a subset D of V such that
every vertex not in D is joined to at least one member of D by some edge.
The domination number γ(G) is the number of vertices in a smallest dominating
set for G.

(ex) dominating set = the red vertices. The domination number of this graph is
2.
[wikipedia]

ex)

4
 Independent Set
Definition: an independent set (stable set) is a set of vertices in a graph,
no two of which are adjacent. That is, it is a set H of vertices such that for
every two vertices in H, there is no edge connecting the two.

f a
The nine blue vertices form a
e b maximum independent set for the
Generalized Petersen graph GP(12,4).
d c
[wikipedia]
{f,c}

Equivalently, each edge in the graph has at most one endpoint in H. The
size of an independent set is the number of vertices it contains.
5
 maximum independent set is an independent set such that adding any other
vertex to the set forces the set to contain an edge.

f a

e b

d c

 {a,d},{a,e},and {a,c,e} are all independent sets.

 {a,c,e} is a maximum independent set.

A maximum independent set is a largest independent set for a given graph

G and its size is denoted α(G).
The subgraph constructed only with vertices in an independent set does not
have any edges. It has only isolated vertices.

6
 Theorem. For any graph G with n vertices,

a. minimum dominating set ≤ maximum independent set

b. χ(G) Ⅹ maximum independent set ≥ n.
f a
 The chromatic number of G, denoted by χ(G), is the smallest
e b
number k for which G is k-colorable.
d c

 {a,d}, {f,c},{f,b,d} and {a,c,e} are all dominating sets.

 {a,d} is a min dominating set.
 {a,d},{a,e},and {a,c,e} are all independent sets.
 {a,c,e} is a maximum independent set.
 |{a,d}| < |{a,c,e}|

7
 Chromatic Number

8
Introduction to Graph Theory by University of California San Diego & National Research University Higher School of Economics - Coursera
 Chromatic Number

Chromatic Number is 3

9
Introduction to Graph Theory by University of California San Diego & National Research University Higher School of Economics - Coursera
 10
Introduction to Graph Theory by University of California San Diego & National Research University Higher School of Economics - Coursera
 Clique
A clique is a subset of the vertex set C ⊆ V, such that for every two vertices
in C, there exists an edge connecting the two.
 (equivalent to) the subgraph induced by C is complete

2 3
{1,2}, {2,4}, {1,2,3} are some cliques in G.
G {1,2,3}{1,2,4} are maximum cliques in G.
4 5

A maximum clique is a clique of the largest possible size in a given graph.

The clique number ω(G) of a graph G is the number of vertices in the largest
clique in G.

11
 12
Introduction to Graph Theory by University of California San Diego & National Research University Higher School of Economics - Coursera
 13
Introduction to Graph Theory by University of California San Diego & National Research University Higher School of Economics - Coursera
Cliques and Independent Set

14
 Graph Coloring
Types
 vertex coloring: no two adjacent vertices
share the same color.

 edge coloring: no two adjacent edges share

the same color.

 face coloring of planar graph: no two

adjacent faces share the same color.

[wikipedia]
15
3 types of coloring problems are the same. Vertex coloring problem is
typical.
 an edge coloring of a graph is just a vertex coloring of its line
graph.
[wikipedia]
G
L(G)

 a face coloring of a planar graph is just a vertex coloring of its

planar dual.

However, some problems are best studied in non-vertex form, as for

instance is edge coloring.

16
 Line Graph
the line graph L(G) of an undirected graph G is another graph L(G)
that represents the adjacencies between edges of G.

Definition. Given a graph G, its line graph L(G) is a graph such that
 each vertex of L(G) represents an edge of G; and
 two vertices of L(G) are adjacent if and only if their corresponding
edges share a common endpoint ("are adjacent") in G.

(ex) [wikipedia]

17
 Vertex Coloring
Definition: Let G be a graph without loops. A k-coloring of G is an
assignment of k colors to the vertices of G in such a way that adjacent
vertices are assigned different colors. If G has a k-coloring, then G is said
to be k-colorable. The chromatic number of G, denoted by χ(G), is the
smallest number k for which G is k-colorable.
3 1 1 2

1 2 2 3 2 5 1 3

2 1 3 4 3 4 3 2
(a) (b) (c) (d)

(a), (b), (c) are 3-coloring, 4-coloring, 5-coloring. (d) is not a permissible
coloring.
χ(G)≤3 according to (a) and since the graph has a clique with 3 vertices,
χ(G)≥3. Hence, χ(G)=3. 18
k-coloring is equivalent to the fact that we can divide the vertices of a
graph into k or more than k independent sets.

independent sets [wikipedia]

Applications:
 scheduling, register allocation of compiler, frequency assignment
of mobile telecommunication, pattern matching.

19
A simple method for obtaining a lower bound for χ(G)
 Look for the largest complete subgraph in G.

It has K4. Hence, χ(G) ≥ 4.

Obviously, χ(G) ≤ n. The upper bound is very poor.

20
Theorem: If G is a simple graph whose maximum vertex-degree is d, then
χ(G) ≤ d+1. [wilson]

The bound provided by above theorem can be far greater than the
actual value of χ(G).
 If G is planar, χ(G) ≤ 4, whereas G may have a vertex of arbitrarily
large degree.
We need only 2 colors. But, the upper bound of
the theorem is 6+1.

Brook’s Theorem: Let G be a connected simple graph whose

maximum vertex-degree is d. If G is neither a cycle graph with an odd
number of vertices, nor a complete graph, then χ(G) ≤ d.
 For K1,100, χ(G)=2, whereas the upper bound of Brook’s theorem is
100.
...
21
 References

[wilson] Graphs An Introductory Approach, Robin J. Wilson, John J. Watkins, 1990

[gibbons] Algorithmic Graph Theory, A. Gibbons, Cambridge, 1985

[gross] Graph Theory and Its Applications by J. L. Gross and J. Yellen, Chapman & Hall/CRC, 2006

[shaum] Graph Theory, Shaum’s Outlines, V.K. Balakrishnan, 1997

[Neapolitan] Foundations Of Algorithms by R. Neapolitan and K. Naimipour, 2009

Wikipedia

22