Ahmed Muhammad (CIIT/FA20-BSM-022/LHR), Sohail Abu Haraira (CIIT/SP20-BSM-013/LHR)Dr. M. Faisal NadeemLHR TP 99122026-01-062024https://repository.cuilahore.edu.pk/handle/123456789/284In this project, we explore several fundamental concepts in graph theory, focusing primarily equitable edge coloring. An equitable edge coloring of a graph is a proper edge coloring for which the difference between any two color classes is at most one. The minimum cardinality of G for such coloring is called equitable edge chromatic number.enDepartment of MathematicsFA20MathematicsEquitableColoringCertain GraphsDr. M. Faisal NadeemOn Equitable Coloring of Certain GraphsThesis