High Quality
Open the downloaded document, and select print from the file menu (PDF reader required).
AMS 301 Spring 2010 HW #4
Chao Xu(106978083)
2.3
1
(l)
It can be colored by 4 colors. It requires at least 3 colors because
K
3
is a subgraph. If there are 3colors, all the coloring will be forced, and will come to a point where there is no color to use.Example of a 4 coloring.
a,d,g
with color 1,
b,e,h
with color 2,
c,f,i
with color 3, the rest are color 4.
(n)
3-colorable. It is the minimal amount of colors required because
K
3
is a subgraph. A possible 3 coloringis.
a,i,j,f
with color 1,
b,d,h
with color 2 and
g,c,e
with color 3.
2
(b)
3 colors. (
d,b
)
,
(
a,e
)
,
(
c,f
) have color 1,(
a,d
)
,
(
e,c
)
,
(
b,f
) have color 2, (
d,c
)
,
(
b,e
)
,
(
a,f
) have color 3.
(e)
3 colors. (
c,d
)
,
(
a,e
)
,
(
b,f
)
,
(
g,h
) have color 1. (
c,a
)
,
(
b,d
)
,
(
e,g
)
,
(
h,f
) have color 2. (
c,g
)
,
(
d,h
)
,
(
a,b
)
,
(
e,f
)have color 3.
12
(a) The set of solar experiments are vertices. If there are overlaps, that is a edge. Searchs for the coloringof the vertices of the graph solves the scheduling problem.(b) 3-color able,
K
3
is a subgraph, thus that’s the minimal amount of colors required.
AC BE DGF
1
Add a Comment
Chao Xuleft a comment