Vertex Coloring of Graph Using Incidence Matrix

Abstract

Graph coloring is one of the potential area of research in Graph theory. The vertex coloring problem is one of the fundamental problem on graphs which often appears in various scheduling problems like file transfer problem on computer networks. Various algorithms for vertex coloring, edge coloring, total coloring etc., are described by various researchers. In this paper, a simple approach is proposed to color all the vertices of a graph with the minimum number of colors. This approach helps us to find chromatic number of a graph using incidence matrix.