Graph coloring involves assigning colors to each vertex of a graph so that no adjacent vertices have the same color. The objective is to minimize the number of colors used. The chromatic number of a graph is the minimum number of colors needed to properly color the graph. The document provides an introduction to graph coloring and chromatic numbers with examples.

1. DISCRETE MATHEMATICS
Guided By :-
Dr. Ashok Misra sir
PresentedBy :-
NAME:- Rajnikant pandey
REG NO:- 220101120115
GRAPH COLORING AND THEIR CHROMATIC
NUMBERS

2.  Graph coloring is the procedure of assignment of
colors to each vertex of a graph G such that no
adjacent vertices get same color. The objective is to
minimize the number of colors while coloring a
graph.
 GRAPH COLORING

3.  EXAMPLE GRAPH COLORING

4.  The chromatic number of a graph
is the minimum number of colors
needed to produce a proper
coloring of a graph.
 CHROMATIC NUMBERS

5.  EAMPLE OF CHROMATIC
NUMBERS

6. THANK YOU!!!!