Efficient Edge Chromatic Number Calculation Using Python:

Abstract

Graph coloring is one of the most important concept in graph theory and is used in many real time applications. Graph coloring includes, vertex coloring, edge coloring, region coloring etc., of graphs. Proper edge coloring means, coloring of edges of a graph such that no two adjacent edges have the same color. Edge chromatic number of a graph is the minimum number of colors required for proper edge coloring of the graph and is denoted by(G). In this article, GEC algorithm is proposed for finding the edge chromatic number of a graph with computer coding for the same using python. This proposed computer algorithm is explained with an example and it helps to understand the execution process of python to find the edge chromatic number of a graph.