id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cana-3478	C. Paul Shyni	Efficient Edge Chromatic Number Calculation Using Python: 	2025	7	.pdf	application/pdf	2385	114	49	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). 5. GEC algorithm using Edge Adjacency matrix In order to find edge chromatic number of a graph using edge adjacency matrix, a step-by-step procedure of GEC algorithm is described below.	cache/cana-3478.pdf	txt/cana-3478.txt