Useful Links
Mathematics
Graph Theory
1. Introduction to Graph Theory
2. Fundamental Concepts and Types of Graphs
3. Representing Graphs
4. Paths, Walks, and Cycles
5. Graph Traversal
6. Trees and Forests
7. Shortest Path Algorithms
8. Network Flow
9. Graph Coloring
10. Planar Graphs
11. Matchings
12. Advanced Topics in Graph Theory
Graph Coloring
Vertex Coloring
Problem Definition
Proper Coloring
Color Classes
Chromatic Number
Bounds and Estimates
Computational Complexity
Coloring Algorithms
Greedy Coloring Algorithm
Vertex Ordering Strategies
Performance Analysis
Backtracking Approaches
Theoretical Results
Brooks' Theorem
Statement and Proof Outline
Exceptions and Applications
Four Color Theorem
Historical Significance
Computer-Assisted Proof
Planar Graph Coloring
Edge Coloring
Problem Definition
Proper Edge Coloring
Color Classes for Edges
Edge Chromatic Number
Relationship to Maximum Degree
Vizing's Theorem
Class 1 and Class 2 Graphs
Characterization Results
Edge Coloring Algorithms
Greedy Approaches
Optimal Algorithms for Special Cases
Applications of Graph Coloring
Scheduling Problems
Exam Scheduling
Course Timetabling
Resource Allocation
Register Allocation
Compiler Optimization
Interference Graphs
Frequency Assignment
Wireless Networks
Radio Broadcasting
Map Coloring
Geographic Applications
Chromatic Polynomials
Definition
Polynomial Function
Deletion-Contraction Recurrence
Properties
Degree and Leading Coefficient
Roots and Their Significance
Calculation Methods
Recursive Computation
Special Graph Families
Previous
8. Network Flow
Go to top
Next
10. Planar Graphs