# Graph Coloring: Chromatic Numbers & Four Color Theorem
> Explore graph theory concepts including chromatic numbers, the Four Color Theorem, and real-world applications in scheduling and networks.

Tags: graph-theory, mathematics, discrete-math, algorithms, computer-science, four-color-theorem, education
## Chromatic Numbers and Graph Theory
* Introduction to chromatic numbers (χ(G)).
* Examples of chromatic numbers in Path Graphs (2), Even Cycles (2), Odd Cycles (3), and Complete Graphs K₄ (4).

## Real-World Applications
* **Exam Scheduling:** Mapping subjects to vertices to avoid time conflicts.
* **Compiler Design:** Register allocation to prevent variable conflicts.
* **Mobile Networks:** Assigning frequencies to towers to avoid interference.
* **Sudoku:** Solving puzzles based on graph coloring constraints.

## The Four Color Theorem
* **The Problem:** Any planar map can be colored using only four colors without neighbors sharing a color.
* **History:** Proposed by Francis Guthrie (1852) and proved by Kenneth Appel and Wolfgang Haken (1976) using computer assistance.

## Graph Coloring Algorithms
* **Greedy Coloring:** A simple, fast sequential algorithm.
* **Welsh-Powell Algorithm:** Sorts vertices by degree to optimize coloring results.

## Complexity and AI
* Graph coloring is NP-hard, making it exponentially difficult as graphs grow.
* Modern uses in AI, wireless communication, operating systems, and transportation management.
---
This presentation was created with [Bobr AI](https://bobr.ai) — an AI presentation generator.