You are on page 1of 1

pendence number of G, defined back in Section 1.4.3.

The proofs are left as an


exercise (see Exercise 6).
Theorem 1.45. For any graph G of order n,
n
≤ χ(G) ≤ n + 1 − α(G).
α(G)
MATERIA: Analisis Discreto Paralelo: 1 Nombre y Matricula:
EVALUACIÓN: Taller 3
Exercises Nombre y Matricula:
TIEMPO DE DURACIÓN: 1:30 hora Nombredegree
1. Recall that avgdeg(G) denotes the average y Matricula:
of vertices in G. Prove
or give a counterexample to the following statement:
1. Los comités senatoriales C1 χ(G) a C7≤constan de los miembros indicados: C1 = {Adams,
1 + avgdeg(G).
Bradford, Charles}, C2 = {Charles, Davis, Eggers}, C3 = {Davis, Ford}, C4 = {Adams,
Gardner}, C5
2. If G = {Eggers,
is the Howe},
graph in Figure 1.92, C6
prove=that
{Eggers,
χ(G) = Bradford,
6 and ω(G) = Gardner},
5. C7 = {Howe,
Charles, Ford}. Determine la menor cantidad de reuniones que se deben programar
3. Determine a necessary and sufficient condition for a graph to have a 2-
para estos comités.
colorable line graph.
2. Sea G un grafo plano conexo de orden menor que 12. Demuestre δ(G) ≤ 4.
4. Recall that τ (G) denotes the number of vertices in a detour path (a longest
3. Determine el número de conectividad, número cromático, número de independencia
path) of G, prove that χ(G) ≤ τ (G).
y la planaridad del grafo de Petersen
4. Sea G5.de Prove that≥the
orden only
11. graph G of order
Demuestre que aln for whichuno
menos χ(G)de=Gn isy K
Gnc .no es plano.
5. Demuestre que
6. Prove thatpara cualquier
for any grafo
graph G of orderGn,de orden n,
n
≤ χ(G) ≤ n + 1 − α(G).
α(G)

6. Sea G7.un
If G is bipartite,
grafo de ordenproventhat = χ(G).
Si d(x)
≥ 3.ω(G) + d(y) ≥ n para todos los pares de vértices no
adyacentes y, aentonces
8. Let Gx,be G es
graph of order n. hamiltoniano
Prove that

(a) n ≤ χ(G)χ(G);

(b) 2 n ≤ χ(G) + χ(G).

1.6.3 The Four Color Problem


That doesn’t sound too hard.
— Princess Leia, Star Wars

The Four Color Problem. Is it true that the countries on any given map can
be colored with four or fewer colors in such a way that adjacent countries are
colored differently?

You might also like