그래프의 색칠에 관한 연구

Abstract

ABSTRACT The study of graph coloring

Jung Ka-young Advisor : Prof. Kang Eun-sil Ph.D. Major in Mathematics Education Graduate School of Education, Chosun University

The purpose of this study is to work on graph coloring which is a coloring vertices of a graph in a proper way. In this paper, we study characteristics of chromatic number which is the minimum number of colors when coloring adjacent vertices in different colors in graph coloring and chromatic polynomial which represents the number of ways when coloring vertices in graph using the given number of colors. And also we review the four color problem including a short summary of proof by Robertson & Sanders & Seymour & Thomas.