Coloring Problem In Graph Theory Applied Research

Graph theory is a jumped-up subject which develops very rapidly in recent years and is applied extensively. Coloring problem in graph theory is a very active research topic, with profound and rich in a wide range of theoretical results and practical application, it's theory and methods plays an important role in discrete mathematics. Because of the coloring problem reflects the extensive and profound cultural background, which led to the study of the development of the entire graph theory.This paper studies a number of practical applications of coloring problem in graph theory. In this paper, the arrangement is as follows: The first chapter describes the origin of graph theory, development and applications. Four color theorem and conjecture, coloring and it's number problem, graph coloring problem the direction of current research and research methods. Chapter II introduces the basic knowledge of coloring, the coloring of a graph is divided into points coloring, edge coloring, total coloring. Chapter III sets up a mathematical model for a problem of chemicals stored, using knowledge of the normal vertex coloring to solve this problem. And two new algorithms for vertex coloring are given. Chapter IV gives the mathematical models for the problems of course scheduling conflict and the university course scheduling system, using normal edge coloring of knowledge to solve these problems, and give an approximation algorithm using edge coloring to solve a problem of course scheduling. Chapter V gives the mathematical description of bin coloring packing problem and bin coloring covering problem .Bin coloring packing problem and bin coloring covering problem, defines the cost of the tree total coloring problem and gains two approximation algorithms restricted to the given bin coloring packing problem and bin coloring covering problem and the cost of the tree total coloring of a 2 -approximation algorithm. Chapter VI concluding remarks.