Application of graph coloring in real life. The problem of choosing which register to save variables in is a graph coloring problem. True for n g 5 induction step. 5 color theorem. Graph coloring and its applications.
All planar graphs can be colored with at most 5 colors basis step. Applications of graph coloring. Thinking about graph coloring problems as colorable vertices and edges at a high level allows us to apply graph coloring algorithms and theory to a number of real world problems. Important real world applications and then tried to give their clear idea from the graph theory.
A graph can give information that might not be possible to express in words. The graph coloring is one of the most important concepts in concept of tree a connected graph without cycles 1 was graph theory and is used in many real time applications in implemented by gustav kirchhoff in 1845 and he employed computer science. Proper coloring of a graph is an assignment of colors either to the vertices of the graphs or to the edges in such a way that adjacent vertices edges are colored differently. Various coloring methods are available and can be used on requirement basis.
The graph coloring problem has huge number of applications. Reviews five real world problems that can be modelled using graph colouring. A graph shows information that equivalent to many words. The minimum number of color is called the chromatic number g and the graph g is called properly colored graph.
Suppose we want to make am exam schedule for a university. G v must be 5 colorable by induction hypothesis proof by example. A graph g is a mathematical structure consisting of two sets v g vertices of g and e g edges of g. If g is 5 colorable done if g is not 5 colorable.
Vertex coloring is one of the most important concepts in graph theory and is used in many real time applications in computer science. The proper coloring of a graph g is the coloring of the vertices and edges with minimal number of colors such that no two vertices should have the same color. Applications of graph coloring. Graphs are important because graph is a way of expressing information in pictorial form.
The cpu has a fixed number of registers so the compiler may try to optimize the usage of registers to speed up the program. N g 5 there exists a vertex v in g of degree at most 5. 1 making schedule or time table. Applications of graph colouring rhyd lewis.