ABSTRACT
The graph coloring problem is a basic one in graph theory and widely used in many real-life areas such as air traffic flow management, timetabling, scheduling, and frequency assignment and so on. The problem shows up in an incredible variety of forms such as vertex coloring, edge coloring, and width coloring, list coloring, set coloring and T-coloring. This chapter applies the finite-value systems and STP method into graph theory. We present the graph maximum stable set theory. After that, we investigate robust graph coloring problem, T-coloring problem, and list coloring problem.
