Chromatic Number of a Graph | Graph Colouring

Graph coloring is a fundamental concept in graph theory, and the chromatic number is a key parameter that quantifies the coloring properties of a graph. Let's go into the introductory aspects of the chromatic number.

Graph coloring refers to the problem of coloring vertices of a graph in such a way that no two adjacent vertices have the samecolor. This is also called the vertex coloring problem. If coloring is done using at most m colors, it is called m-coloring.

The of a graph G, denoted as χ(G), is the minimum number of colors required to color the vertices of a graph G in such a way that no two adjacent vertices share the same color. Formally, it is the smallest positive integer k for which there exists a proper vertex coloring with k colors.

• The chromatic number is an essential parameter that captures the inherent colorability of a graph.
• It provides insights into the structural properties and relationships within the graph.

• A vertex coloring of a graph assigns colors to its vertices in a way that no two adjacent vertices have the same color.
• Proper vertex coloring ensures that adjacent vertices have distinct colors.

👁 Image

A graph is known as a cycle graph if it contains ‘n’ edges and ‘n’ vertices (n >= 3), which form a cycle of length ‘n’. The chromatic number in a cycle graph depends upon the parity of cycle length:

Case 1 (Odd length cycle): χ(G) = 3.

Case 2(Even length cycle): χ(G) = 2.

The chromatic number of a complete graph is equal to the number of vertices in the graph.

Non-empty bipartite graphs have a chromatic number of 2.

since the two parts are each independent sets and can be colored with a single color. Conversely, if a graph can be 2-colored, it is bipartite, since all edges connect vertices of different colors

The chromatic number of a star graph is 2.

The chromatic number of a wheel graph is 3 if the number of vertices is even, and 4 if the number of vertices is odd.

A Planar Graph is a graph that can be drawn in a plane such that none of its edges cross each other.

χ(Planar Graph) <= 4

χ(Trees) = 2.

Here are some properties of the chromatic number:

• : The chromatic number of a graph is at most the maximum vertex degree, unless the graph is complete or an odd cycle, in which case the chromatic number is equal to the maximum vertex degree plus one2. This is known as Brooks’ theorem2.
  
• : The chromatic number of a graph is at least the size of the largest clique in the graph3. A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent3.

• : A graph with a chromatic number of 2 is said to be bicolorable2. This means that the vertices of the graph can be colored using only two colors in such a way that no two adjacent vertices share the same color2.
  
• : A graph with a chromatic number of 3 is said to be three-colorable2. This means that the vertices of the graph can be colored using only three colors in such a way that no two adjacent vertices share the same color2.
  
• : The chromatic number of a complete graph is equal to the number of vertices in the graph1. A complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge1.
  
• : The chromatic number of a cycle graph is 2 if the number of vertices in the graph is even, and 3 if the number of vertices in the graph is odd1.
  
• : The only graphs that can be 1-colored are edgeless graphs3. An edgeless graph is a graph with no edges3

• : Chromatic number is a form of graph labeling, which is crucial in representing and analyzing graphs.
• : The chromatic number is directly related to the classic map coloring problem, where the goal is to color regions of a map (represented as vertices) such that no two adjacent regions share the same color.
• : Graphs with low chromatic numbers often have special properties. For example, trees are 2-colorable (have chromatic number 2), and bipartite graphs have chromatic number 2.
• : Graph coloring algorithms, including those based on chromatic number, are used in scheduling problems, register allocation in compilers, and various optimization tasks.
• : The chromatic number is linked to combinatorial questions, such as finding the minimum number of colors needed to color a graph or identifying graphs with specific colorability properties.
• : The chromatic number is intertwined with other graph parameters and theorems, contributing to a deeper understanding of graph theory.

There are several algorithms to find the chromatic number of a graph, each with its own strengths and weaknesses in terms of complexity:

• Idea: Assign colors to vertices sequentially, choosing the first available color (not used by any neighbors) for each vertex.
• Complexity: O(V + E), where V is the number of vertices and E is the number of edges.
• Pros: Simple to implement, fast for sparse graphs.
• Cons: Doesn't guarantee optimal solution for all graphs, often overestimates the chromatic number.

Implementation:

Chromatic Number: 4

• Idea: Systematically explore all possible colorings by assigning colors to each vertex and backtracking if an invalid coloring is encountered.
• Complexity: O(V! * K^V), where K is the number of available colors and V is the number of vertices. This can be exponential for large graphs.
• Pros: Guarantees optimal solution, can be modified for specific constraints.
• Cons: Very slow for large graphs, impractical for real-world scenarios.

Implementation:

Vertex colors: 1 2 3 2 
Chromatic Number: 3

• Idea: Utilize various heuristics to guide the search for a valid coloring, often combining greedy approaches with elements of backtracking or other techniques.
• Examples: Simulated annealing, genetic algorithms, tabu search.
• Complexity: Varies depending on the specific heuristic, usually between O(V * E) and O(V! * K^V).
• Pros: Can find good solutions for large graphs in reasonable time, offer a balance between speed and accuracy.
• Cons: No guarantee of optimality, performance depends on the chosen heuristic and its parameters.

• Examples: Branch and bound, integer linear programming.
• Complexity: Typically exponential in the worst case, but can be effective for specific graph classes.
• Pros: Guaranteed to find the optimal solution, valuable for theoretical understanding.
• Cons: Computationally expensive, often impractical for large graphs due to high runtime.

• For small graphs or quick estimates, a greedy algorithm might be sufficient.
• For optimal solutions and theoretical insights, consider exact algorithms, but be aware of their computational limitations.
• For large graphs and a good balance between speed and accuracy, heuristic algorithms are often the best choice.

The Chromatic Number (χ) and Chromatic Polynomial (P(G, λ)) of a graph are two fascinating concepts in graph theory, each revealing different aspects of a graph's colorability. While they seem unrelated at first glance, they share a deep and intriguing connection.

:

• Tells you the minimum number of colors needed to color the graph's vertices without adjacent vertices sharing the same color.
• Represents the "practical" aspect of coloring, focusing on the minimum number of palettes required.

:

• Encodes much more information about the graph's possible colorings, not just the minimum number.
• It's a function of a variable (λ) that represents the number of valid colorings for a graph with λ available colors.
• Provides insights into the distribution of colorings, including the number of colorings with a specific number of colors.

• : The Chromatic Number is the smallest positive integer λ for which P(G, λ) is non-zero. This means the polynomial tells you when a valid coloring with λ colors exists, and the first color where such a coloring is possible is the Chromatic Number.
• : The coefficients of the polynomial represent the number of valid colorings with a specific number of colors. This allows you to analyze the "spectrum" of colorings for a graph, beyond just the minimum.
• : The polynomial can be used to prove theorems about graph coloring, analyze the complexity of different colorability problems, and even understand the structure of graphs through their colorings.

Imagine the Chromatic Number as the "minimum number of paint buckets" you need to color a graph. The Chromatic Polynomial, on the other hand, is like a "painting inventory" that tells you how many different ways you can paint the graph with different numbers of buckets available.

Introduction to Graph Coloring

M-Coloring Problem

Graph Coloring Using Greedy Algorithm

Edge Coloring of a Graph

Coloring a Cycle Graph

Chromatic Polynomial