Scribd
Upload
2 views12 pages

GT M5

The document discusses various concepts in graph theory, including chromatic numbers, chromatic polynomials, matchings, and coverings. It explains the conditions under which graphs can be colored and the significance of odd-length cycles in determining chromaticity. Additionally, it touches on the Four-Color Problem, stating that every planar graph can be colored with no more than four colors without adjacent regions sharing the same color.

Uploaded by

sagarashrivibha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views12 pages

GT M5

The document discusses various concepts in graph theory, including chromatic numbers, chromatic polynomials, matchings, and coverings. It explains the conditions under which graphs can be colored and the significance of odd-length cycles in determining chromaticity. Additionally, it touches on the Four-Color Problem, stating that every planar graph can be colored with no more than four colors without adjacent regions sharing the same color.

Uploaded by

sagarashrivibha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

3 chromatic.

• A graph consisting of only isolated vertices is 1-chromatic.


• A graph with one or more edges (not a self-loop, of course) is at least 2
chromatic.
• A complete graph of n vertices is n-chromatic, as all its vertices are adjacent.
• A graph consisting of simply one circuit with n ≥ 3 vertices is 2-chromatic if n is
even and 3-chromatic if n is odd.
• Every tree with two or more vertices is 2-chromatic.
THEOREM:A graph with at least one edge is 2-chromatic if and only if it has no circuits of odd
length.

If a graph has no odd-length cycles, then it is 2-chromatic:


Conversely, if G has a circuit of odd length, we would need at least three colors just for that
circuit. Thus the theorem.
CHROMATIC POLYNOMIAL
It counts the number of proper colorings of a graph's vertices using k colors, where a proper coloring
means no two adjacent vertices share the same color.
• Definition
Given a graph G, the chromatic polynomial PG(k) gives the number of ways to color the vertices of G with
k colors such that adjacent vertices receive different colors.
• Since i can be any positive integer from 1 to n, the chromatic polynomial is a sum
of these terms; that is
• Each ci has to be evaluated individually for the given graph.
c1 = 0.
• A graph with n vertices and using n different colors can be properly colored in n! ways; that is,
cn = n!.
• Let us find the chromatic polynomial of the graph given in

• c1 = c2 = 0 and c5 = 5!.
• to evaluate c3, suppose that we have three colors x, y, and z. These three colors can be assigned properly to vertices v1, v2,
and v3 in 3! = 6 different ways.
• we have no more choices left, because vertex v5 must have the same color as v3, and v4 must have the same color as v2.
Therefore, c3 = 6
• with four colors, v1, v2, and v3 can be properly colored in 4·6 = 24 different ways. The fourth color can be assigned to v4 or v5,
thus providing two choices. The fifth vertex provides no additional choice. Therefore, c4 = 24·2 = 48.
• Substituting these coefficients in P5(λ),
• P5(λ) = λ (λ − 1)(λ − 2) + 2λ(λ − 1)(λ − 2)(λ − 3) + λ(λ − 1)(λ − 2)(λ − 3)(λ − 4)
• = λ(λ − 1)(λ − 2)(λ2 − 5λ + 7)
• The presence of factors λ – 1 and λ – 2 indicates that G is at least 3-chromatic
MATCHINGS
• matching (or assignment) of one set of vertices into another. More formally, a matching in a graph is a
subset of edges in which no two edges are adjacent. A single edge in a graph is obviously a matching.
• In graph theory, a matching (or assignment) is a subset of edges in which no two edges share a
common vertex.

Maximal Matching:
• A matching that cannot be extended by adding more edges.

largest maximal matchings(Maximum Matching):


A matching that contains the largest possible number of edges.

matching number:
The number of edges in a largest maximal matching
COVERINGS
• In graph theory, a covering (or vertex/edge cover) refers to a set of elements (either vertices or edges)
that "cover" certain components of a graph. There are two main types:
1. Vertex Cover
2. Edge Cover
• In a triangle graph with vertices A,B,C and edges AB,BC,CA a vertex cover could be {A,B}— it covers all
edges.

• minimal covering–a covering from which no edge can be removed without destroying its ability to cover
the graph.
Four-Color Problem
Every planar graph can be colored using no more than four colors in such a way that no two adjacent
regions share the same color.

Vertex Coloring Versus Region Coloring:

You might also like